On polyhedron graph density in problems of combinatorial optimization

From MaRDI portal

Publication:1326866

Jump to:navigation, search

zbMath0806.90101MaRDI QIDQ1326866

V. A. Bondarenko

Publication date: 13 July 1994

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

zbMATH Keywords

shortest path graphs of polyhedra polyhedron graph density separation into triangles three- dimensional combination

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

On graphs of the cone decompositions for the min-cut and max-cut problems

This page was built for publication: On polyhedron graph density in problems of combinatorial optimization

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1326866&oldid=13449033"