Segments in enumerating edges
Conference
·
OSTI ID:36322
We introduce the concept of a segment of a degenerate convex polytope specified by a system of linear constraints, and explain its importance in developing algorithms for enumerating the faces. Using segments, we describe an algorithm that enumerates all the faces, in time polynomial in their number. The role of segments in the unsolved problem of enumerating the extreme points of a convex polytope specified by a degenerate system of linear constraints, in time polynomial in the number of extreme points, is discussed.
- OSTI ID:
- 36322
- Report Number(s):
- CONF-9408161-; TRN: 94:009753-0660
- Resource Relation:
- Conference: 15. international symposium on mathematical programming, Ann Arbor, MI (United States), 15-19 Aug 1994; Other Information: PBD: 1994; Related Information: Is Part Of Mathematical programming: State of the art 1994; Birge, J.R.; Murty, K.G. [eds.]; PB: 312 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Enumerating extreme rays of a cone
On dicycle packings and the linear ordering polytope
On extreme points of the diffusion polytope
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:36322
+1 more
On dicycle packings and the linear ordering polytope
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:36322
On extreme points of the diffusion polytope
Journal Article
·
Wed Jan 04 00:00:00 EST 2017
· Physica. A
·
OSTI ID:36322