The setup polyhedron of series-parallel posets

DOI10.1016/S0166-218X(97)00044-9zbMath0888.06002OpenAlexW2160831259MaRDI QIDQ1372744

Rainer Schrader, Georg Wambach

Publication date: 1 June 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

jump numberoptimization problempolyhedral combinatoricsincidence vectorsbump numberseries-parallel posetssetup polyhedron

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorics of partially ordered sets (06A07)

Cites Work

• Unnamed Item
• NP-completeness properties about linear extensions
• Minimizing completion time for a class of scheduling problems
• Jump number problem: The role of matroids
• Minimizing the jump number for partially ordered sets: A graph-theoretic approach
• Minimizing bumps in linear extensions of ordered sets
• Setup optimization problems with matroid structure
• Computing the bump number is easy
• Computing the bump number with techniques from two-processor scheduling
• On a property of the class of n-colorable graphs

This page was built for publication: The setup polyhedron of series-parallel posets