Polyhedral Methods for the Max-Cut Problem

Abstract

New polyhedral methods have been developed for the solution of a class of programming problems of importance in VLSI design. There methods have made possible an order-of-magnitude increase in the size of problems that can be successfully solved.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 31, 1991
Accession Number
ADA244641

Entities

People

  • Robert E. Bixby

Organizations

  • Rice University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Integer Programming
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Optimization
  • Sequences
  • Standards
  • Universities

Readers

  • Integrated Circuit Design and Technology.
  • Operations Research