A network relaxation based enumeration algorithm for set partitioning
- 1 January 1989
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 38 (1) , 76-85
- https://doi.org/10.1016/0377-2217(89)90471-2
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Extracting embedded generalized networks from linear programming problemsMathematical Programming, 1985
- Automatic identification of embedded network rows in large-scale optimization modelsMathematical Programming, 1984
- A good submatrix is hard to findOperations Research Letters, 1982
- A note on some computationally difficult set covering problemsMathematical Programming, 1980
- Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization ModelsManagement Science, 1980
- The Set-Covering Problem: A New Implicit Enumeration AlgorithmOperations Research, 1977
- On the Set-Covering Problem: II. An Algorithm for Set PartitioningOperations Research, 1975
- On improving relaxation methods by modified gradient techniquesPublished by Springer Nature ,1975
- On the Set-Covering ProblemOperations Research, 1972
- The Set-Partitioning Problem: Set Covering with Equality ConstraintsOperations Research, 1969