Integral Polyhedra in Three Spaces

Preprint

preprint

Published in RePEc

Abstract

In a series of recent papers I have introduced a particular class of convex polyhedra in R n , arising in the study of integer programming problems with n variables. In the present paper a detailed analysis of these polyhedra will be given for the case in which n = 3; the analysis is based on an unpublished theorem demonstrated several years ago by Roger Howe, which seems to have no immediate generalization to higher values of n . (This abstract was borrowed from another version of this item.)

Keywords

PROGRAMMING PROBLEMS
POLYHEDRA
INTEGER PROGRAMMING
DETAILED ANALYSIS
RECENT PAPERS
HIGHER VALUES
NO IMMEDIATE
ROGER HOWE
THEOREM DEMONSTRATED
UNPUBLISHED THEOREM

All Related Versions

Version 1, RePEc

This publication has 0 references indexed in Scilit: