Polyhedral convexity cuts and negative edge extensions

DOI10.1007/BF02026599zbMath0288.90056MaRDI QIDQ4777060

Fred Glover

Publication date: 1974

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Facet inequalities from simple disjunctions in cutting plane theory, A finite procedure to generate feasible points for the extreme point mathematical programming problem, Intersection Disjunctions for Reverse Convex Sets, Outer-product-free sets for polynomial optimization and oracle-based cuts, A finite cutting plane method for solving linear programs with an additional reverse convex constraint, A finitely convergent procedure for facial disjunctive programs, Degeneracy removal in cutting plane methods for disjoint bilinear programming, Optimization of linear-convex programs, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, Polyhedral annexation in mixed integer and combinatorial programming, A branch-and-cut algorithm for mixed-integer bilinear programming, A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts, On the implementation and strengthening of intersection cuts for QCQPs, On the implementation and strengthening of intersection cuts for QCQPs, Enhanced intersection cutting-plane approach for linear complementarity problems

Cites Work

• Unnamed Item
• The Generalized Lattice-Point Problem
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Hypercylindrically Deduced Cuts in Zero-One Integer Programs
• Enumerative Cuts: I
• Convexity Cuts and Cut Search