95-15
New Facets of the Linear Ordering Polytope
by Bolotashvili, G.; Girlich, E.; Kovalev,M.
Preprint series: 95-15, Preprints
- MSC:
- 90C10 Integer programming
Abstract: The linear ordering problem has many applications and was stud-ied by many authors. One approach to solve this problem, the so-called cutting plane method derives facet defining inequalities, whichare violated by current fractional solution and adds them to the systemof equalities and inequalities of current linear programming problem.
The author(s) agree, that this abstract may be stored asfull text and distributed as such by abstracting services.