On the public citation graph
Test sets of integer programs
0 signed · 58 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 this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/200.1432-0622openalex-snapshot
Applicable Algebra in Engineering, Communication and Computing
inferredcites →https://doi.org/10.1007/3-540-53904-2_94openalex-snapshot
Minimal solutions of linear diophantine systems : bounds and algorithms
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_57openalex-snapshot
GRIN: An implementation of Gröbner bases for integer programming
inferredcites →https://doi.org/10.1007/3-540-60313-1_164openalex-snapshot
0/1-Integer programming: Optimization and Augmentation are equivalent
inferredcites →https://doi.org/10.1007/3-540-63397-9_8openalex-snapshot
Decomposition of integer programs and of generating sets
inferredcites →https://doi.org/10.1007/978-1-4612-0913-3openalex-snapshot
Gröbner Bases: A Computational Approach to Commutative Algebra
inferredcites →https://doi.org/10.1007/978-1-4757-2181-2openalex-snapshot
Ideals, Varieties, and Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-94-009-5225-6_6openalex-snapshot
Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory
inferredcites →https://doi.org/10.1007/bf01442864openalex-snapshot
Ueber die Auflösung linearer Gleichungen mit reellen Coefficienten
inferredcites →https://doi.org/10.1007/bf01580443openalex-snapshot
An alternate implementation of Goldfarb's minimization algorithm
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/bf02579200openalex-snapshot
An application of simultaneous diophantine approximation in combinatorial optimization
inferredcites →https://doi.org/10.1007/bf02614622openalex-snapshot
Variation of cost functions in integer programming
inferredcites →https://doi.org/10.1007/bfb0035826openalex-snapshot
Geometry of numbers and integer programming
inferredcites →https://doi.org/10.1007/s002000050062openalex-snapshot
Truncated Gröbner Bases for Integer Programming
inferredcites →https://doi.org/10.1016/0022-0000(85)90039-xopenalex-snapshot
Scaling algorithms for network problems
inferredcites →https://doi.org/10.1016/0024-3795(79)90018-1openalex-snapshot
Total dual integrality and integer polyhedra
inferredcites →https://doi.org/10.1016/0095-8956(86)90064-xopenalex-snapshot
An integer analogue of Carathéodory's theorem
inferredcites →https://doi.org/10.1017/cbo9781107325715.011openalex-snapshot
Matroids in Combinatorial Optimization
inferredcites →https://doi.org/10.1057/9781137024411_2openalex-snapshot
Production Sets with Indivisibilities Part I: Generalities
inferredcites →https://doi.org/10.1057/9781137024411_5openalex-snapshot
Neighborhood Systems for Production Sets with Indivisibilities
inferredcites →https://doi.org/10.1057/jors.1981.67openalex-snapshot
Discrete Structures and Algorithms
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1137/s0895480195281209openalex-snapshot
A Variant of the Buchberger Algorithm for Integer Programming
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1287/moor.12.3.415openalex-snapshot
Minkowski's Convex Body Theorem and Integer Programming
inferredcites →https://doi.org/10.1287/moor.20.4.864openalex-snapshot
A Geometric Buchberger Algorithm for Integer Programming
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/1971436openalex-snapshot
Covering Minima and Lattice-Point-Free Convex Bodies
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
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-540-76796-1_19openalex-snapshot
On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-17022-5_44openalex-snapshot
Regions of Stability for Nonlinear Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-04331-8_30openalex-snapshot
Decomposition Methods for Two-Stage Stochastic Integer Programs
inferred← citeshttps://doi.org/10.1007/s10107-002-0322-1openalex-snapshot
Decomposition of test sets in stochastic integer programming
inferred← citeshttps://doi.org/10.1007/s10107-003-0384-8openalex-snapshot
A primal all-integer algorithm based on irreducible solutions
inferred← citeshttps://doi.org/10.1007/s10107-003-0385-7openalex-snapshot
On the positive sum property and the computation of Graver test sets
inferred← citeshttps://doi.org/10.1007/s10107-011-0447-1openalex-snapshot
Cone superadditivity of discrete convex functions
inferred← citeshttps://doi.org/10.1007/s13160-012-0080-2openalex-snapshot
Universal Gröbner basis associated with the maximum flow problem
inferred← citeshttps://doi.org/10.1016/j.orl.2003.11.007openalex-snapshot
Optimality criterion for a class of nonlinear integer programs
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00235-4openalex-snapshot
Inverse optimization in high-speed networks
inferred← citeshttps://doi.org/10.1080/02331934.2014.883509openalex-snapshot
A class of integer linear fractional bilevel programming problems
inferred← citeshttps://doi.org/10.14988/di.2017.0000016140openalex-snapshot
Studies on mathematical structures of network optimization problems
inferred← citeshttps://doi.org/10.48550/arxiv.2012.11382openalex-snapshot
Quantum Integer Programming (QuIP) 47-779: Lecture Notes
inferred← citeshttps://doi.org/10.48550/arxiv.math/0309154openalex-snapshot
Test Sets for Integer Programs with Z-Convex Objective
inferred← citeshttps://doi.org/10.48550/arxiv.math/0410334openalex-snapshot
Exploiting Symmetries in the Computation of Graver Bases
inferred← citeshttps://doi.org/10.48550/arxiv.math/0508359openalex-snapshot
Computing generating sets of lattice ideals
inferred← citeshttps://doi.org/10.48550/arxiv.math/0612615openalex-snapshot
Truncated Markov bases and Gröbner bases for Integer Programming
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.