A note on order preserving matchings

We study order preserving injections or bipartite matchings from poset V1 to poset V2. When V1 is totally ordered, we give an efficient algorithm for the associated optimization problem and the convex hull of the corresponding characteristic vectors. If V2 is totally ordered and V1 is not, the problem is NP-complete.


Published in:
Operations Research Letters, 8, 4, 197-200
Year:
1989
Note:
PRO 89.01
Laboratories:




 Record created 2006-02-13, last modified 2018-12-03


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)