A Class of Cuts and Related Algorithms in Integer Programming.

Abstract

A new family of intersection cuts is obtained from a class of convex polyhedra (generalized octahedra). It is shown that these cuts can also be obtained as convex combinations of the Gomory mixed integer cuts. A constructive approach to obtain improved (i.e. deeper) cuts is then presented and discussed. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1970
Accession Number
AD0723088

Entities

People

  • Claude-alain Burdet

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Integer Programming
  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.
  • Operations Research