Integer programming and convex analysis: Intersection cuts from outer polars

DOI10.1007/BF01584553MaRDI QIDQ5675140zbMATH OpenOpenAlexFDO

Authors E. 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

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

Cites work

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

Cited in

(12)

• Disjunctive programming: Properties of the convex hull of feasible points
• The geometry of optimal transportation
• Intersection cuts -- standard versus restricted
• Intersection cuts for convex mixed integer programs from translated cones
• On minimal valid inequalities for mixed integer conic programs
• On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
• Spherical cuts for integer programming problems
• Polyhedral polarity defined by a general bilinear inequality
• Polyhedral annexation in mixed integer and combinatorial programming
• Intersection Disjunctions for Reverse Convex Sets
• Branch-and-cut solution approach for multilevel mixed integer linear programming problems
• Depth-optimized convexity cuts

This page was built for publication: Integer programming and convex analysis: Intersection cuts from outer polars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5675140)