ON DIAGONALIZATION METHODS IN INTEGER PROGRAMMING

Abstract

IMPROVEMENT IN THE EXISTING AREA OF INTEGER PROGRAMMING CODES IN THE EASY GENERATION OF EFFICIENT CUTTING HYPERPLANES IS STUDIED. In this analysis the problem is approached by using a triangular canonical form. In part 1 an algorithm is given based on Gomory's all-integer integer programming algorithm, which constitutes a first step in this direction. This procedure is a practical analog of a deepest cut method discussed in the second part of the analysis. A brief outline and flow diagram for the algorithm are given; finally the algorithm and the deepest cut problem are illustrated by examples.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1962
Accession Number
AD0288053

Entities

People

  • Richard Van Slyke
  • Roger J-B Wets

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Business Administration
  • California
  • Equations
  • Government Procurement
  • Integer Programming
  • Linear Programming
  • Mathematics
  • Military Research
  • Navy
  • New Jersey
  • New York
  • Operations Research
  • Rhode Island
  • Simplex Method
  • United States
  • Universities

Readers

  • Linear Algebra
  • Operations Research
  • Regression Analysis.