The setup polytope of \(N\)-sparse posets

DOI10.1023/A:1018926512983zbMath0958.90039OpenAlexW175330921MaRDI QIDQ1960314

Georg Wambach, Rainer Schrader

Publication date: 11 January 2000

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

Full work available at URL: https://doi.org/10.1023/a:1018926512983

zbMATH Keywords

single-machine schedulingpolyhedral combinatoricsjump number problem\(N\)-sparse posetsbump number problemsetup problem

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorics of partially ordered sets (06A07) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Symmetry properties of polytopes (52B15)

This page was built for publication: The setup polytope of \(N\)-sparse posets