Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems

zbMath0801.90094MaRDI QIDQ1324027

V. A. Bondarenko

Publication date: 24 July 1994

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

polynomial-time algorithmssystems of linear constraintspolyhedra with exponential graph density

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

This page was built for publication: Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems