Set covering with almost consecutive ones property
- 1 November 2004
- journal article
- Published by Elsevier in Discrete Optimization
- Vol. 1 (2), 215-228
- https://doi.org/10.1016/j.disopt.2004.07.002
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The weighted consecutive ones problem for a fixed number of rows or columnsOperations Research Letters, 2003
- An Evolutionary Algorithm for Large Scale Set Covering Problems with Application to Airline Crew SchedulingLecture Notes in Computer Science, 2000
- Algorithms for the Set Covering ProblemAnnals of Operations Research, 2000
- A Heuristic Method for the Set Covering ProblemOperations Research, 1999
- On the consecutive ones propertyDiscrete Applied Mathematics, 1998
- Algorithms for railway crew managementMathematical Programming, 1997
- On the hardness of approximating minimization problemsJournal of the ACM, 1994
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Binary Logic Solutions to a Class of Location Problem*Geographical Analysis, 1973
- Optimal Capacity Scheduling—IOperations Research, 1962