Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey

R. R. Vemuganti ()
Additional contact information
R. R. Vemuganti: University of Baltimore, Merrick School of Business

A chapter in Handbook of Combinatorial Optimization, 1998, pp 573-746 from Springer

Abstract: Abstract Set covering, set packing and set partitioning models are a special class of linear integer programs. These models and their variants have been used to formulate a variety of practical problems in such areas as capital budgeting, crew scheduling, cutting stock, facilities location, graphs and networks, manufacturing, personnel scheduling, vehicle routing and timetable scheduling among others. Based on the special structure of these models, efficient computational techniques have been developed to solve large size problems making it possible to solve many real world applications. This paper is a survey of the applications of the set covering, set packing, set partitioning models and their variants, including generalizations.

Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:sprchp:978-1-4613-0303-9_9

Ordering information: This item can be ordered from
http://www.springer.com/9781461303039

DOI: 10.1007/978-1-4613-0303-9_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().