scientific article; zbMATH DE number 2040941

MaRDI QIDQ4452091zbMATH OpenFDO

Authors Sammani Abdullahi, Martin Dyer, L. G. Proll

Publication date 11 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2731/27310089.htm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Efficient enumeration of the vertices of polyhedra associated with network LP's
• A basis enumeration algorithm for linear systems with geometric applications
• A POLYNOMIAL ALGORITHM FOR ENUMERATING ALL VERTICES OF A BASE POLYHEDRON
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• The Complexity of Vertex Enumeration Methods

Cited in

(1)

• The negative cycles polyhedron and hardness of checking some polyhedral properties

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452091)