On the convex hull of feasible solutions to certain combinatorial problems
Authors:
- 29 February 1992
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 11 (1) , 1-11
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Single-Machine Scheduling Polyhedra with Precedence ConstraintsMathematics of Operations Research, 1991
- On the convex hull of the union of certain polyhedraOperations Research Letters, 1988
- A warning about cyclic lot scheduling with sequence dependent set-up timesInternational Journal of Production Research, 1988
- The traveling salesman problem on a graph and some related integer polyhedraMathematical Programming, 1985
- On the facial structure of scheduling polyhedra1985
- On the Polyhedrality of the Convex Hull of the Feasible Set of an Integer ProgramSIAM Journal on Control and Optimization, 1978