Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

Set-partitioning problem

Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_942
  • 37 Downloads
The set-partitioning problem is an integer-programming problem defined as follows:
  • Minimize cxv

  • subject to Exv = ev

where the components of Ev are either 1 or 0, the components of the column vector ev are all 1s, and the variables are restricted to be either 1 or 0. It is similar to a set-covering problem except multiple coverage is allowed. Packing problem; Set-covering problem.

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  1. 1.Robert H. Smith School of BusinessUniversity of MarylandCollege PartUSA
  2. 2.School of Information Technology & EngineeringGeorge Mason UniversityFairfaxUSA