Improved Bounds for a Class of 0-1 Integer Programs Using Combined Surrogate-Lagrangean Techniques

Abstract

A new method is described for calculating bounds for a special class of 0-1 integer programming problems. This method includes features of both Lagrangean and surrogate relaxation approaches. Certain binary knapsack calculations carried out in appropriate combinations together with an additivity principle provide the basis for computing the bounds.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1975
Accession Number
ADA017936

Entities

People

  • Fred W. Glover
  • G. T. Ross

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Additives (Chemicals)
  • Algorithms
  • Coefficients
  • Commerce
  • Commodities
  • Computer Programming
  • Inequalities
  • Integer Programming
  • Linear Programming
  • Military Research
  • Simplex Method
  • Standards
  • United States
  • United States Government
  • Universities

Readers

  • Computational Modeling and Simulation
  • Operations Research