On the public citation graph

Test sets for integer programs

https://doi.org/10.1007/bf02614324
0 signed · 35 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-54522-0_102openalex-snapshot
Buchberger algorithm and integer programming
inferredcites →https://doi.org/10.1007/3-540-59408-6_55openalex-snapshot
The topological structure of maximal lattice free convex bodies: The general case
inferredcites →https://doi.org/10.1007/978-1-4757-2181-2openalex-snapshot
Ideals, Varieties, and Algorithms
inferredcites →https://doi.org/10.1007/bf01204720openalex-snapshot
Lattice translates of a polytope and the Frobenius problem
inferredcites →https://doi.org/10.1007/bf01581150openalex-snapshot
The complex of maximal lattice free simplices
inferredcites →https://doi.org/10.1007/bf01681344openalex-snapshot
On the foundations of linear and integer linear programming I
inferredcites →https://doi.org/10.1007/bf02614622openalex-snapshot
Variation of cost functions in integer programming
inferredcites →https://doi.org/10.1057/9781137024411_2openalex-snapshot
Production Sets with Indivisibilities Part I: Generalities
inferredcites →https://doi.org/10.1057/9781137024411_3openalex-snapshot
Production Sets with Indivisibilities Part II. The Case of Two Activities
inferredcites →https://doi.org/10.1057/9781137024411_4openalex-snapshot
Integral Polyhedra in Three Space
inferredcites →https://doi.org/10.1057/9781137024411_5openalex-snapshot
Neighborhood Systems for Production Sets with Indivisibilities
inferredcites →https://doi.org/10.1057/jors.1979.114openalex-snapshot
Mathematics for Operations Research
inferredcites →https://doi.org/10.1287/moor.10.3.403openalex-snapshot
Integral Polyhedra in Three Space
inferredcites →https://doi.org/10.1287/moor.20.4.864openalex-snapshot
A Geometric Buchberger Algorithm for Integer Programming
inferredcites →https://doi.org/10.2307/1905251openalex-snapshot
Annual Survey of General Economic Theory: The Problem of Index Numbers
inferredcites →https://doi.org/10.2307/1911124openalex-snapshot
Production Sets with Indivisibilities, Part I: Generalities
inferredcites →https://doi.org/10.2307/1911306openalex-snapshot
Neighborhood Systems for Production Sets with Indivisibilities
inferredcites →https://doi.org/10.2307/2344737openalex-snapshot
The Computation of Economic Equilibria.
inferredcites →https://doi.org/10.5860/choice.30-5053openalex-snapshot
Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_37openalex-snapshot
Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials
inferred← citeshttps://doi.org/10.1007/s00453-013-9834-8openalex-snapshot
A Randomized Sieving Algorithm for Approximate Integer Programming
inferred← citeshttps://doi.org/10.1016/j.disc.2012.02.014openalex-snapshot
Combinatorial types of bicyclic polytopes
inferred← citeshttps://doi.org/10.1016/j.disopt.2017.08.004openalex-snapshot
Solving MIPs via scaling-based augmentation
inferred← citeshttps://doi.org/10.1017/9781009701587.004openalex-snapshot
An Algorithmic Theory of Lattice Points in Polyhedra
inferred← citeshttps://doi.org/10.1017/jsl.2015.4openalex-snapshot
PRESBURGER ARITHMETIC, RATIONAL GENERATING FUNCTIONS, AND QUASI-POLYNOMIALS
inferred← citeshttps://doi.org/10.1080/00207543.2013.774507openalex-snapshot
Planned spontaneity for better product availability
inferred← citeshttps://doi.org/10.1090/psapm/061/2104733openalex-snapshot
Algebraic recipes for integer programming
inferred← citeshttps://doi.org/10.1090/s0273-0979-04-01015-8openalex-snapshot
Book Review: Discrete convex analysis
inferred← citeshttps://doi.org/10.1090/s0894-0347-03-00428-4openalex-snapshot
Short rational generating functions for lattice point problems
inferred← citeshttps://doi.org/10.1109/focs.2017.13openalex-snapshot
Short Presburger Arithmetic Is Hard
inferred← citeshttps://doi.org/10.1137/151002915openalex-snapshot
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
inferred← citeshttps://doi.org/10.1287/moor.1080.0320openalex-snapshot
Parametric Integer Programming in Fixed Dimension
inferred← citeshttps://doi.org/10.14279/depositonce-1523openalex-snapshot
Orthogonal Surfaces - A combinatorial approach
inferred← citeshttps://doi.org/10.4171/022-3/39openalex-snapshot
The complexity of generating functions for integer points in polyhedra and beyond
inferred← citeshttps://doi.org/10.5555/2627817.2627897openalex-snapshot
Minimizing the number of lattice points in a translated polygon
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.