Fences Are Futile: On Relaxations for the Linear Ordering Problem
Authors:
- 21 June 2001
- book chapter
- Published by Springer Nature
- p. 333-347
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Some optimal inapproximability results1997
- The strongest facets of the acyclic subgraph polytope are unknownLecture Notes in Computer Science, 1996
- The interval order polytope of a digraphLecture Notes in Computer Science, 1995
- Geometric Algorithms and Combinatorial Optimization1988
- Facets of the linear ordering polytopeMathematical Programming, 1985
- On the acyclic subgraph polytopeMathematical Programming, 1985