On unions and dominants of polytopes

DOI10.1007/S10107-003-0432-4zbMath1098.90092OpenAlexW2111590511MaRDI QIDQ1434071

Nicolai Pisaruk, Alexander Bockmayr, Egon Balas, Laurence A. Wolsey

Publication date: 1 July 2004

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

Full work available at URL: https://doi.org/10.1007/s10107-003-0432-4

zbMATH Keywords

matroidsseparationcardinality constraintspolymatroidsconvex hullsdominantunions of polytopes

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (8)

Cardinality constraints and systems of restricted representatives ⋮ Constraint programming and operations research ⋮ Tight Approximations of Dynamic Risk Measures ⋮ Strong valid inequalities for orthogonal disjunctions and bilinear covering sets ⋮ Ideal, non-extended formulations for disjunctive constraints admitting a network representation ⋮ A polyhedral approach to the \textit{alldifferent} system ⋮ A branch-and-cut procedure for the Udine course timetabling problem ⋮ Modelling either-or relations in integer programming

This page was built for publication: On unions and dominants of polytopes