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).

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.