TWO ALGORITHMS FOR INTEGER OPTIMIZATION,

Abstract

The paper presents two algorithms for solving zero-one programming problems. The algorithms are also suited for solving mixed integer programming problems, that is, when some of the variables are required to be zero or one but the other variables may take on any nonnegative value. The two algorithms are very similar in that both use the dual method to solve the associated linear programming problem. However, the tree search procedures used are different. In the first, the order of variables in a partial solution is fixed in backtracking. In the other, there is some flexibility in backtracking. Different choice procedures for selecting a variable to fix at zero or one are used. Computational results are presented. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 05, 1969
Accession Number
AD0697320

Entities

People

  • Andrew Whinston
  • Edna Loehman
  • Ph. T. Nghiem

Organizations

  • Purdue University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Integer Programming
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Optimization
  • Resilience

Fields of Study

  • Mathematics

Readers

  • Operations Research