A Polynomial Algorithm for Enumerating All Vertices of a Base Polyhedron
Year of publication: |
1997
|
---|---|
Authors: | Zhan, Ping |
Published in: |
Journal of the Operations Research Society of Japan : JORSJ. - Tokyo : Soc., ISSN 0453-4514, ZDB-ID 715544x. - Vol. 40.1997, 3, p. 329-340
|
Saved in:
Saved in favorites
Similar items by person
-
A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra
Zhan, Ping, (2005)
-
Polyhedra and Optimization Related to a Weak Absolute Majorization Ordering
Zhan, Ping, (2005)
-
A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra
Zhan, Ping, (2005)
- More ...