Polyhedral annexation in mixed integer and combinatorial programming

DOI10.1007/BF01681342zbMath0364.90073OpenAlexW2082948434MaRDI QIDQ4139972

Fred Glover

Publication date: 1975

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

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

Mathematics Subject Classification ID

Integer programming (90C10) Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx)

Related Items (14)

Facet inequalities from simple disjunctions in cutting plane theory ⋮ Representability in mixed integer programming. I: Characterization results ⋮ A simplification for some disjunctive formulations ⋮ Strengthening cuts for mixed integer programs ⋮ Foundation-penalty cuts for mixed-integer programs. ⋮ A finitely convergent procedure for facial disjunctive programs ⋮ Relaxations for probabilistically constrained programs with discrete random variables ⋮ Degeneracy removal in cutting plane methods for disjoint bilinear programming ⋮ Optimality conditions for disjunctive optimization in reflexive Banach spaces ⋮ A note on duality in disjunctive programming ⋮ A converse for disjunctive constraints ⋮ A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts ⋮ Minimal inequalities ⋮ Representability of functions

Cites Work

• Unnamed Item
• Unnamed Item
• Disjunctive programming: Properties of the convex hull of feasible points
• Convexity cuts for multiple choice problems
• Some polyhedra related to combinatorial problems
• Cutting-planes for programs with disjunctive constraints
• Inequalities for mixed integer programs with structure
• Convex and polaroid extensions
• The Disjunctive-Facet Problem: Formulation and Solution Techniques
• Trivial integer programs unsolvable by branch-and-bound
• Polyhedral convexity cuts and negative edge extensions
• The Generalized Lattice-Point Problem
• A tree-search algorithm for mixed integer programming problems
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Hypercylindrically Deduced Cuts in Zero-One Integer Programs
• Some continuous functions related to corner polyhedra
• Integer programming and convex analysis: Intersection cuts from outer polars
• Enumerative Cuts: I
• Polaroids: A new tool in non‐convex and in integer programming
• Convexity Cuts and Cut Search

This page was built for publication: Polyhedral annexation in mixed integer and combinatorial programming