A POLYNOMIAL ALGORITHM FOR ENUMERATING ALL VERTICES OF A BASE POLYHEDRON
type: Item
instance of: scholarly article
title: A POLYNOMIAL ALGORITHM FOR ENUMERATING ALL VERTICES OF A BASE POLYHEDRON
zbMATH Open document ID: 0894.90129
author: Ping Zhan
published in: Journal of the Operations Research Society of Japan
publication date: 1998-09-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 52B05
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1089448
zbMATH Keywords: enumeration of all vertices
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: submodular base polyhedron
MaRDI profile type: Publication
full work available at URL: jorsj.40.329
OpenAlex ID: W1983688368
DOI: 10.15807/JORSJ.40.329
Recommended article: A new algorithm to find all vertices of a polytope
Recommended article: An algorithm for enumeration of polyhedra and orbifolds
Recommended article: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
Recommended article: A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
Recommended article: Q4331201
Recommended article: Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
Recommended article: Numerical Algorithm for Pólya Enumeration Theorem
Recommended article: Efficient enumeration of the vertices of polyhedra associated with network LP's
Recommended article: An efficient algorithm for enumeration of triangulations
description: scientific article; zbMATH DE number 1089448