A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- 1 December 1994
- journal article
- research article
- Published by Springer Science and Business Media LLC in Annals of Operations Research
- Vol. 50 (1), 219-237
- https://doi.org/10.1007/bf02085641
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A facet generation and relaxation technique applied to an assignment problem with side constraintsEuropean Journal of Operational Research, 1991
- A production planning problem in FMSAnnals of Operations Research, 1989
- An inexact algorithm for the sequential ordering problemEuropean Journal of Operational Research, 1988
- The k best spanning arborescences of a networkNetworks, 1980
- Finding optimum branchingsNetworks, 1977
- Validation of subgradient optimizationMathematical Programming, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Science and Business Media LLC ,1974
- Optimum branchingsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967