Fences are futile: On relaxations for the linear ordering problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2081, Issue , 2001, Pages 333-347

  Newman, Alantha ^a   Vempala, Santosh ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; FENCES; LADDERS; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION; SET THEORY;

EXTREMAL; INTEGRALITY GAPS; LINEAR ORDERING PROBLEMS; LINEAR PROGRAMMING RELAXATION; POLYNOMIAL-TIME; PROBABILISTIC METHODS;

INTEGER PROGRAMMING;

EID: 84947258753     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45535-3_26     Document Type: Conference Paper

References (12)

1. Alberto Caprara and Matteo Fischetti, 1/2-Chvatal-Gomory cuts, Mathematical Programming, 74A, 1996, 221-235.
2. P. Erdos and H. Sachs, Regulare Graphe gegebener Taillenweite mit minimaler Knotenzahl, Wiss. Z. Univ. Halle-Wittenberg, Math. Nat. 12, 1963, 251-258.
3. M. X. Goemans and L. A. Hall, The Strongest Facets of the Acyclic Subgraph Polytope are Unknown, Proceedings of IPCO 1996, 415-429.
4. M. Grotschel, M. Junger, and G. Reinelt, On the Maximum Acyclic Subgraph Polytope, Mathematical Programming, 33, 1985, 28-42.
5. M. Grotschel, M. Junger, and G. Reinelt, Facets of the Linear Ordering Polytope, Mathematical Programming, 33, 1985, 43-60.
6. M. Grotschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, New York, 1988.
7. Johan Hastad, Some Optimal Inapproximability Results, Proceedings of STOC, 1997.
8. Richard M. Karp, Reducibility Among Combinatorial Problems, Complexity of Computer Computations, Plenum Press, 1972.
9. Rudolf Mueller, On the Partial Order Polytope of a Digraph, Mathematical Programming, 73, 1996, 31-49.
10. Alantha Newman, Approximating the Maximum Acyclic Subgraph, M.S. Thesis, MIT, June 2000.
11. S. Poljak, Polyhedral and Eigenvalue Approximations of the Max-Cut Problem, Sets, Graphs and Numbers, Colloq. Math. Soc. Janos Bolyai 60, 1992, 569-581.
12. Andreas Schulz and Rudolf Mueller, The Interval Order Polytope of a Digraph, Proceedings of IPCO 1995, 50-64.