Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem

Alantha Newman. Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem. In Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron, editors, Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Compu. Volume 3122 of Lecture Notes in Computer Science, pages 195-206, Springer, 2004. [doi]

Abstract

Abstract is missing.