The Principles of Cutting-Plane Theory. Part II. Algebraic Methods, Disjunctive Methods.

Abstract

In this paper the author, surveys the algebraic and disjunctive methods, and includes several new results, such as finiteness proofs for new classes of cuttingplane algorithms, a subadditive algorithm for integer programs, and sharpened results on subadditive dual programs, plus other theorems. The author has tried to bring together many of the most quoted results in the theory of integer programming, to provide the most concise proofs for these of which he is aware, and to show the interrelations between these results.

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1975
Accession Number
ADA015908

Entities

People

  • Robert G. Jeroslow

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Integer Programming
  • Mathematics

Fields of Study

  • Mathematics

Readers

  • Business Analytics
  • Mathematical Modeling and Probability Theory.
  • Operations Research