The travelling preacher, projection, and a lower bound for the stability number of a graph

DOI10.1016/j.disopt.2007.08.005zbMath1151.90056OpenAlexW2090424186MaRDI QIDQ951102

Kathie Cameron, Jack Edmonds

Publication date: 29 October 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2007.08.005

zbMATH Keywords

stable setcirculationnetwork flowtotal dual integralityGallai's conjectureprojection of a polyhedrontravelling salesman cost allocation game

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Minmax relations for cyclically ordered digraphs
• Coflow polyhedra
• Geometric algorithms and combinatorial optimization.
• On approximately fair cost allocation in Euclidean TSP games
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Minimum cost spanning tree games
• Combinatorial optimization. Theory and algorithms.
• Unnamed Item

This page was built for publication: The travelling preacher, projection, and a lower bound for the stability number of a graph