Polyhedral annexation in mixed integer and combinatorial programming

DOI10.1007/BF01681342MaRDI QIDQ4139972zbMATH OpenOpenAlexFDO

Authors 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) Polytopes and polyhedra (52Bxx) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Cites work

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

Cited in

(14)

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

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

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