``Outline of an algorithm for integer solutions to linear programs and ``An algorithm for the mixed integer problem
DOI10.1007/978-3-540-68279-0_4zbMATH Open1187.90011OpenAlexW116026073MaRDI QIDQ3565233FDOQ3565233
Authors: Ralph E. Gomory
Publication date: 3 June 2010
Published in: 50 Years of Integer Programming 1958-2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68279-0_4
Recommendations
Integer programming (90C10) Mixed integer programming (90C11) Collected or selected works; reprintings or translations of classics (01A75) History of operations research and mathematical programming (90-03)
Cited In (8)
- Reflections on Proof Complexity and Counting Principles
- On the pseudo-periodicity of the integer hull of parametric convex polygons
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
- Computing the integer hull of convex polyhedral sets
- The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers
- Cutting planes width and the complexity of graph isomorphism refutations
- An application of mathematical logic to the integer linear programming problem
- A distributed optimization approach via symmetric group actions under time-varying communication networks
This page was built for publication: ``Outline of an algorithm for integer solutions to linear programs and ``An algorithm for the mixed integer problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565233)