Facet separation for disjunctive constraints with network flow representation

DOI10.1007/S10479-024-06264-2MaRDI QIDQ6644361zbMATH OpenFDO

Authors Péter Dobrovoczki, Tamás Kis

Publication date 27 November 2024

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10479-024-06264-2

zbMATH Keywords

branch-and-cutdisjunctive programmingembedding formulations

Mathematics Subject Classification ID

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

Cites work

• A combinatorial approach for small and strong formulations of disjunctive constraints
• A geometric way to build strong mixed-integer programming formulations
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• Disjunctive programming
• Disjunctive Programming
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• Disjunctive programming: Properties of the convex hull of feasible points
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• Ideal, non-extended formulations for disjunctive constraints admitting a network representation
• Small and strong formulations for unions of convex sets from the Cayley embedding
• The Cayley trick, lifting subdivisions and the Bohne-Dress theorem on zonotopal tilings

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

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