Ranking the facets of the octahedron☆

https://doi.org/10.1016/0012-365X(72)90056-8Get rights and content
Under an Elsevier user license
open archive

Abstract

This 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 arise, in the context of integer programming via convex analysis (or intersection cuts).

Cited by (0)

☆

This research was supported in part by the National Science Foundation and by the U.S. Office of Naval Research

Copyright © 1972 Published by Elsevier B.V.