An algorithm for set covering problem
- 1 July 1987
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 31 (1), 85-93
- https://doi.org/10.1016/0377-2217(87)90141-x
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- An Applications Oriented Guide to Lagrangian RelaxationInforms Journal on Applied Analytics, 1985
- Identifying Redundant Constraints and Implicit Equalities in Systems of Linear ConstraintsManagement Science, 1983
- Exact solution of crew scheduling problems using the set partitioning model: Recent successful applicationsNetworks, 1981
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational studyPublished by Springer Nature ,1980
- Cutting planes from conditional bounds: A new approach to set coveringPublished by Springer Nature ,1980
- Efficient Heuristic Solutions to an Airline Crew Scheduling ProblemA I I E Transactions, 1979
- An Integer Programming Approach to the Vehicle Scheduling ProblemJournal of the Operational Research Society, 1976
- An Analysis of Private and Public Sector Location ModelsManagement Science, 1970
- Letter to the Editor—On Optimal Extracting from a Multiple File Data Storage System: An Application of Integer ProgrammingOperations Research, 1965