Integer programming and convex analysis: Intersection cuts from outer polars

DOI10.1007/BF01584553zbMath0259.90023OpenAlexW2082139992MaRDI QIDQ5675140

Egon Balas

Publication date: 1972

Published in: Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10)

Related Items

On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts, Intersection Disjunctions for Reverse Convex Sets, The geometry of optimal transportation, Spherical cuts for integer programming problems, Intersection cuts -- standard versus restricted, Intersection cuts for convex mixed integer programs from translated cones, Polyhedral annexation in mixed integer and combinatorial programming, On Minimal Valid Inequalities for Mixed Integer Conic Programs, Disjunctive programming: Properties of the convex hull of feasible points, Polyhedral polarity defined by a general bilinear inequality, Depth-optimized convexity cuts

Cites Work

• Unnamed Item
• Unnamed Item
• Some polyhedra related to combinatorial problems
• A duality theorem and an algorithm for (mixed-) integer nonlinear programming
• Ranking the facets of the octahedron
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
• Convex Analysis
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• An Intersection Cut from the Dual of the Unit Hypercube
• Canonical Cuts on the Unit Hypercube
• Cut search methods in integer programming
• Enumerative inequalities in integer programming
• Convexity Cuts and Cut Search