Partition polytopes over 1-dimensional points

DOI10.1007/s101070050060zbMath0955.90116OpenAlexW2088278186MaRDI QIDQ1300273

Uriel G. Rothblum, Biao Gao, Frank K. Hwang, Wen-Ch'ing Winnie Li

Publication date: 4 March 2001

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

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

zbMATH Keywords

partitionspolytopessupermodular functionssystem-assembly

Mathematics Subject Classification ID

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

Related Items (6)

Permutation polytopes corresponding to strongly supermodular functions ⋮ The mean-partition problem ⋮ Equivalence of permutation polytopes corresponding to strictly supermodular functions ⋮ Good Clusterings Have Large Volume ⋮ Linear-shaped partition problems ⋮ Supermodularity in mean-partition problems

This page was built for publication: Partition polytopes over 1-dimensional points