Set Partitioning: A Survey,

reportActive / Technical Report | Accession Number: ADA025600 | Need Help?

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. Part 1 gives some background material. Part 2 deals with structural properties of the set packing and set partitioning polytopes. Part 3 focuses on algorithms.

Author(s):
Balas, Egon ; Padberg, Manfred W.
Author Organization(s):
CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
Supplementary Note:
Prepared in cooperation with New York Univ., N.Y. A revised and expanded version of the authors' Lecture Notes for the NATO Advanced Study Inst. on Combinatorial Programming (Versailles, Sep 2-13, 1974.)
Pagination:
0093

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
RR-386
Contract/Grant Number(s):
N00014-75-C-0621, NSF-MPS73-08534
Project Number(s):
NR-047-048
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*LINEAR PROGRAMMING, *INTEGER PROGRAMMING, *SET THEORY, ALGORITHMS, SCHEDULING, THEOREMS
Field(s)/Group(s):
Operations Research
Keyword(s):
*Partitions(Mathematics), Graph theory, *Set packing polytopes, Cutting plane method
Report Date:
1976 Feb 01