Set Partitioning: A Survey,

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.

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1976
Accession Number
ADA025600

Entities

People

  • Egon Balas
  • Manfred W. Padberg

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Cooperation
  • Coverings
  • Materials
  • New York
  • Structural Properties

Readers

  • Business Analytics
  • Graph Algorithms and Convex Optimization.
  • Operations Research