Skip to main content
Book Chapter

Set Partitioning

  • Balas E
  • Padberg M
Springer Netherlands, (1975), 205-258
DOI: 10.1007/978-94-011-7557-9_11
N/ACitations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper discusses the set partitioning or equality-constrained set covering problem. It is a survey of theoretical results and solution methods for this problem, and while we have tried not to omit anything important, we have no claim to completeness. Critical...

Cite

CITATION STYLE

APA

Balas, E., & Padberg, M. W. (1975). Set Partitioning. In Combinatorial Programming: Methods and Applications (pp. 205–258). Springer Netherlands. https://doi.org/10.1007/978-94-011-7557-9_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free