Order preserving assignments without contiguity Original Research Article

A variation of the order preserving assignment problem introduced in [8] is studied. The complete linear description of the associated polytope is derived and a polynomial-time separation algorithm for the describing inequalities is presented. A polynomial-time direct combinatorial algorithm based on dynamic programming and a longest path formulation of the problem are also given.