Ranking the Facets of the Octahedron.

Abstract

The paper describes a procedure for ranking the facets of the n-dimensional (regular) octahedron in the order in which they are intersected by a halfline. The problem discussed here arises in the context of integer programming via convex analysis (or intersection cuts). (Author)

Document Details

Document Type
Technical Report
Publication Date
May 01, 1971
Accession Number
AD0729419

Entities

People

  • Egon Balas

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Computing-Related Activities
  • Integer Programming
  • Interdisciplinary Science
  • Mathematical Programming
  • Mathematics
  • Operations Research

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.