Disjunctive programming and relaxations of polyhedra

DOI10.1007/S10107-013-0634-3MaRDI QIDQ2452382zbMATH OpenOpenAlexWikidataFDO

Authors Michele Conforti, Alberto Del Pia

Publication date 2 June 2014

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL http://doc.rero.ch/record/325599/files/10107_2013_Article_634.pdf

zbMATH Keywords

mixed integer programmingdisjunctive programmingpolyhedral relaxations

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) (n)-dimensional polytopes (52B11) Mixed integer programming (90C11)

Recommendations

• Disjunctive programming: Properties of the convex hull of feasible points
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• Polyhedra related to integer-convex polynomial systems
• Relaxations of mixed integer sets from lattice-free polyhedra
• Relaxations of mixed integer sets from lattice-free polyhedra

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• A note on the MIR closure and basic relaxations of polyhedra
• A note on the split rank of intersection cuts
• A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
• An analysis of mixed integer linear sets based on lattice point free convex sets
• Disjunctive programming: Properties of the convex hull of feasible points
• Equivalence between intersection cuts and the corner polyhedron
• Generalized intersection cuts and a new cut generating paradigm
• Intersection cuts with infinite Split rank
• On convergence in mixed integer programming
• On the rank of disjunctive cuts
• Split closure and intersection cuts

Cited in

(9)

• Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
• Sublinear bounds for a quantitative Doignon-Bell-Scarf theorem
• A simplification for some disjunctive formulations
• scientific article; zbMATH DE number 1379519 (Why is no real title available?)
• On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
• Relaxations of mixed integer sets from lattice-free polyhedra
• Relaxations of mixed integer sets from lattice-free polyhedra
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• Geometric proofs for convex hull defining formulations

This page was built for publication: Disjunctive programming and relaxations of polyhedra

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