A Graph Theoretic Equivalence for Integer Programs.

Abstract

The paper is concerned with the relationship between 0-1 integer programs and graphs. An equivalence is established between solving 0-1 integer programs with quadratic or linear objective function and linear constraints and finding minimum cut sets in graphs with both positive and negative are numbers. (Author)

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1971
Accession Number
AD0731784

Entities

People

  • H. Donald Ratliff
  • Jean-claude Picard

Organizations

  • University of Florida

Tags

Readers

  • Graph Algorithms and Convex Optimization.