On \({\mathbb{K}}^{\Delta}\)

DOI10.1016/0166-218X(86)90042-9zbMath0616.90055OpenAlexW2528163337MaRDI QIDQ1821691

Sung-Jin Chung, Katta G. Murty, Soo Y. Chang

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(86)90042-9

zbMATH Keywords

NP-completeconvex hull of extreme pointscombinatorial-facial structureHamiltonian chainsmaximum capacity cutssystem of linear constraintsunbounded convex polyhedral subset

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Polytopes and polyhedra (52Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• The ellipsoid method and its consequences in combinatorial optimization
• A combinatorial abstraction of linear programming
• Two-Processor Scheduling with Start-Times and Deadlines
• The adjacency relation on the traveling salesman polytope is NP-Complete
• On the Relation Between the Traveling-Salesman and the Longest-Path Problems
• Adjacency on Convex Polyhedra

This page was built for publication: On \({\mathbb{K}}^{\Delta}\)