On the public citation graph
Mathematical programming study 8
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.
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.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0471667196.ess1556.pub2openalex-snapshot
Mathematical Programming
inferred← citeshttps://doi.org/10.1002/1520-6750(199210)39:6<839::aid-nav3220390609>3.0.co;2-copenalex-snapshot
Partial polyhedral description and generation of discrete optimization problems with known optima
inferred← citeshttps://doi.org/10.1002/nav.3800310118openalex-snapshot
An efficient heuristic for large set covering problems
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_23openalex-snapshot
Some Problems on Approximate Counting in Graphs and Matroids
inferred← citeshttps://doi.org/10.1007/978-3-642-79459-9_22openalex-snapshot
An Integer Programming Approach to Optimal Software Metrics Selection
inferred← citeshttps://doi.org/10.1007/978-3-642-85970-0_1openalex-snapshot
Solution of Large-Scale Railway Crew Planning Problems: the Italian Experience
inferred← citeshttps://doi.org/10.1007/bf00934910openalex-snapshot
Perturbation theory for abstract optimization problems
inferred← citeshttps://doi.org/10.1007/bf01873970openalex-snapshot
Some notions of nonstationary multistep iteration processes
inferred← citeshttps://doi.org/10.1080/00137919608903167openalex-snapshot
OPTIMAL REPLACEMENT OF DURABLE EQUIPMENT IN HEAT TRANSMISSION SYSTEMS
inferred← citeshttps://doi.org/10.1080/02331939208843770openalex-snapshot
Bounds for the symmetric 2-peripatetic salesman problem
inferred← citeshttps://doi.org/10.1111/j.1468-0262.2006.00667.xopenalex-snapshot
Hard-to-Solve Bimatrix Games
inferred← citeshttps://doi.org/10.1142/s0217595910002946openalex-snapshot
SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY
inferred← citeshttps://doi.org/10.1155/fpta/2006/35390openalex-snapshot
Weak convergence of an iterative sequence for accretive operators in Banach spaces
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.