New Facets of the Linear Ordering Polytope

@article{Bolotashvili1999NewFO,
  title={New Facets of the Linear Ordering Polytope},
  author={G. Bolotashvili and Michail M. Kovalev and Eberhard Girlich},
  journal={SIAM J. Discrete Math.},
  year={1999},
  volume={12},
  pages={326-336}
}
The linear ordering problem has many applications and was studied by many authors (see 5, 9, 12] for survey). One approach to solve this problem, the so-called cutting plane method 8, 14] derives facet-deening inequalities, which are violated by current nonfeasible solution and adds them to the system of inequalities of current linear programming problem. We present a method (rotation method) for generating new facets of polyhedra by using already known ones. The rotation method for the linear… CONTINUE READING