Decomposition in Integer Programming.

Abstract

Contents: Resource Decomposition: A Conceptual Outline; Branching in the Rudimentary Branch-and-Bound Algorithm; Computing Bounds: Single Linking Constraint Case; Computing Bounds: Multiple Linking Constraints Case; Computational Results; and Conclusions, Extensions, and Areas for Future Research.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1976
Accession Number
ADA033114

Entities

People

  • Gary A. Kochman

Organizations

  • Stanford University

Tags

Communities of Interest

  • Energy and Power Technologies
  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Central Processing Units
  • Computations
  • Computer Programming
  • Computers
  • Evolutionary Algorithms
  • Heuristic Methods
  • Integer Programming
  • Linear Programming
  • Mathematical Models
  • Mathematical Programming
  • Military Research
  • New York
  • Operations Research
  • Optimization
  • Simplex Method
  • Trees (Data Structures)

Readers

  • Operations Research
  • Theoretical Analysis.