A POLYNOMIAL ALGORITHM FOR ENUMERATING ALL VERTICES OF A BASE POLYHEDRON

DOI10.15807/jorsj.40.329zbMath0894.90129OpenAlexW1983688368MaRDI QIDQ4366145

Ping Zhan

Publication date: 7 September 1998

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.40.329

zbMATH Keywords

polynomial algorithmenumeration of all verticessubmodular base polyhedron

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

This page was built for publication: A POLYNOMIAL ALGORITHM FOR ENUMERATING ALL VERTICES OF A BASE POLYHEDRON