On the public citation graph

Mathematical Programming Studies

0 signed · 15 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9783527631216.ch6openalex-snapshot
Bilevel and Multilevel Programming
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_23openalex-snapshot
Optimization Applications in the Airline Industry
inferred← citeshttps://doi.org/10.1007/978-3-030-01090-4_17openalex-snapshot
Efficient Symbolic Representation of Convex Polyhedra in High-Dimensional Spaces
inferred← citeshttps://doi.org/10.1007/978-3-030-33585-4_26openalex-snapshot
Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-93642-6_7openalex-snapshot
The Grossone-Based Diagonal Bundle Method
inferred← citeshttps://doi.org/10.1007/bf02592026openalex-snapshot
Piecewise-linear programming: The compact (CPLP) algorithm
inferred← citeshttps://doi.org/10.1007/s10107-018-1342-9openalex-snapshot
On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
inferred← citeshttps://doi.org/10.1007/s10107-020-01575-1openalex-snapshot
Error bounds for inequality systems defining convex sets
inferred← citeshttps://doi.org/10.1007/s10479-011-1026-9openalex-snapshot
An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
inferred← citeshttps://doi.org/10.1007/s10589-015-9788-7openalex-snapshot
Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/s10589-019-00072-2openalex-snapshot
Inexact alternating direction methods of multipliers for separable convex optimization
inferred← citeshttps://doi.org/10.1017/s0963548324000130openalex-snapshot
Rainbow Hamiltonicity in uniformly coloured perturbed digraphs
inferred← citeshttps://doi.org/10.1145/2213977.2214068openalex-snapshot
A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities
inferred← citeshttps://doi.org/10.1145/2629553openalex-snapshot
Understanding Intrinsic Diversity in Web Search
inferred← citeshttps://doi.org/10.2298/bg20130708maticopenalex-snapshot
Solving some problems in teaching by using combinatorial optimization methods
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.