Base polytopes of series-parallel posets: Linear description and optimization

DOI10.1007/BF01585869MaRDI QIDQ1290639zbMATH OpenFDO

Authors Rainer Schrader, Andreas S. Schulz, Georg Wambach

Publication date 3 June 1999

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

zbMATH Keywords

greedy algorithmpolyhedral combinatoricssupermodular functiontotal weighted completion timeseries-parallel posetsbase polytopes

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Integer programming (90C10) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Recommendations

• The permutahedron of series-parallel posets
• The setup polyhedron of series-parallel posets
• scientific article; zbMATH DE number 1015115
• Facets of the generalized permutahedron of a poset

Cites work

• A Rearrangement Inequality and the Permutahedron
• Adjacent Vertices on a Permutohedron
• Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
• Facets of the generalized permutahedron of a poset
• Facets of the knapsack polytope
• Generalized polymatroids and submodular flows
• On a property of the class of n-colorable graphs
• Pseudomatroids
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Single-Machine Scheduling Polyhedra with Precedence Constraints
• Submodular functions and optimization
• Submodular linear programs on forests
• The permutahedron of \(N\)-sparse posets
• The permutahedron of series-parallel posets
• The permutahedron of series-parallel posets

Cited in

(2)

• The setup polyhedron of series-parallel posets
• The permutahedron of series-parallel posets

This page was built for publication: Base polytopes of series-parallel posets: Linear description and optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290639)