On the Group Problem and a Subadditive Approach to Integer Programming.

Abstract

The study of Gomory's group problem has led to a subadditive approach to integer programming. This paper traces that development using the cyclic group problem and knapsack problem as prototypes. The asymptotic theorem of Gomory is also discussed. Finally, an algorithm giving a constructive proof of a subadditive dual problem for the knapsack problem is presented.

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1977
Accession Number
ADA050346

Entities

People

  • Ellis L. Johnson

Organizations

  • IBM Thomas J. Watson Research Center

Tags

DTIC Thesaurus Topics

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

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Operations Research
  • Systems Analysis and Design