On the convex hull of feasible solutions to certain combinatorial problems

DOI10.1016/0167-6377(92)90055-8zbMath0764.90070OpenAlexW2020059491MaRDI QIDQ1198616

Yaoguang Wang, Maurice Queyranne

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90055-8

zbMATH Keywords

convex hullconvex polyhedronfinite unionnonpreemptive single- machine scheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds, Fitting piecewise linear continuous functions

Cites Work

• Unnamed Item
• On the convex hull of the union of certain polyhedra
• Structure of a simple scheduling polyhedron
• The traveling salesman problem on a graph and some related integer polyhedra
• On the facial structure of scheduling polyhedra
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Single-Machine Scheduling Polyhedra with Precedence Constraints
• On the Polyhedrality of the Convex Hull of the Feasible Set of an Integer Program