Facet separation for disjunctive constraints with network flow representation

DOI10.1007/s10479-024-06264-2MaRDI QIDQ6644361

Péter Dobrovoczki, Tamás Kis

Publication date: 27 November 2024

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

disjunctive programmingbranch-and-cutembedding formulations

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx) Polytopes and polyhedra (52Bxx)

Cites Work

• Unnamed Item
• Disjunctive programming: Properties of the convex hull of feasible points
• The Cayley trick, lifting subdivisions and the Bohne-Dress theorem on zonotopal tilings
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• Ideal, non-extended formulations for disjunctive constraints admitting a network representation
• A geometric way to build strong mixed-integer programming formulations
• Small and strong formulations for unions of convex sets from the Cayley embedding
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• Disjunctive Programming
• Disjunctive Programming
• A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints

This page was built for publication: Facet separation for disjunctive constraints with network flow representation