Set covering and set partitioning: A collection of test problems

E El-Darzi and G Mitra

Omega, 1990, vol. 18, issue 2, 195-201

Abstract: It is now well established that set covering and set partitioning models play a central role in many scheduling applications. There are many algorithms which solve these problems. In order to test and validate implementations of such algorithms we have collected a range of test problems taken from different contexts. A brief description of these models, their applications and summary model data, are supplied in this paper.

Keywords: linear; programming; integer; programming; crew; scheduling; vehicle; scheduling; set; covering; set; partitioning (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0305-0483(90)90066-I
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:18:y:1990:i:2:p:195-201

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().