Back to Search
Start Over
A heuristic method for the set covering problem
- Source :
- Operations Research. Sept-Oct, 1999, Vol. 47 Issue 5, p730, 14 p.
- Publication Year :
- 1999
-
Abstract
- An algorithmic solution is presented addressing the set covering problem in scheduling management. The algorithm is based on a dynamic variable pricing scheme, subgradient optimization, and the utilization of column fixing to improve outcomes.
- Subjects :
- Algorithms -- Models
Scheduling (Management) -- Models
Business
Mathematics
Subjects
Details
- ISSN :
- 0030364X
- Volume :
- 47
- Issue :
- 5
- Database :
- Gale General OneFile
- Journal :
- Operations Research
- Publication Type :
- Periodical
- Accession number :
- edsgcl.58220303