Structure of a simple scheduling polyhedron
- 1 January 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 58 (1-3) , 263-285
- https://doi.org/10.1007/bf01581271
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Formulating the single machine sequencing problem with release dates as a mixed integer programDiscrete Applied Mathematics, 1990
- On the facial structure of scheduling polyhedraPublished by Springer Nature ,1985
- Submodular systems and related topicsPublished by Springer Nature ,1984
- Lower bounds for algebraic computation treesPublished by Association for Computing Machinery (ACM) ,1983
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Characterizations of adjacency of faces of polyhedraPublished by Springer Nature ,1981
- Single machine scheduling to minimize weighted sum of completion times with secondary criterion — A branch and bound approachEuropean Journal of Operational Research, 1980
- General Lattice TheoryPublished by Springer Nature ,1978
- Analyse Algébrique D’un ScrutinPublished by Walter de Gruyter GmbH ,1970
- Sur L’analyse des PréférencesPublished by Walter de Gruyter GmbH ,1970