Improved convexity cuts for lattice point problems

DOI10.1007/BF00934097zbMath0307.90053OpenAlexW2012357394MaRDI QIDQ1218339

Darwin D. Klingman, Fred Glover

Publication date: 1976

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00934097

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items

Network reduction for the acyclic constrained shortest path problem, A branch-and-cut algorithm for mixed-integer bilinear programming, Disjunctive programming: Properties of the convex hull of feasible points

Cites Work

• The Disjunctive-Facet Problem: Formulation and Solution Techniques
• The Generalized Lattice-Point Problem
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Hypercylindrically Deduced Cuts in Zero-One Integer Programs
• Convexity Cuts and Cut Search