Linear Programming Tools for Integer Programming

Abstract

The motivation for this work has been the need for a practical procedure to solve the maximum-weight cut problem (MCP) in undirected graphs. Our primary focus has been on problems arising from considerations in statistical mechanics. These problems are typically posed on grid graphs and some natural variants. There has been significant progress in two areas: solution of the maximum-weight cut problem and development of simplex-based tools for integer programming. Codes developed have been widely used to improve solution time.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 31, 1989
Accession Number
ADA219013

Entities

People

  • Robert E. Bixby

Organizations

  • Rice University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Gaussian Distributions
  • Heuristic Methods
  • Inequalities
  • Integer Programming
  • Iterations
  • Linear Programming
  • Mechanics
  • New York
  • Optimization
  • Random Variables
  • Stalling
  • Standards
  • Statistical Mechanics
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research
  • Theoretical Analysis.