Stable multi-sets

DOI10.1007/s001860200199zbMath1023.90086OpenAlexW1987195160MaRDI QIDQ1396917

Arie M. C. A. Koster, Adrian Zymolka

Publication date: 14 July 2003

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

Full work available at URL: https://doi.org/10.1007/s001860200199

zbMATH Keywords

valid inequalitiespolyhedral combinatoricsgeneralized stable sets

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Combinatorial optimization (90C27)

Related Items

Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts, Separating multi-oddity constrained shortest circuits over the polytope of stable multisets., MIPLIB 2003, Virtual private network design over the first Chvátal closure, On cycles and the stable multi-set polytope