Exact solution approaches for bilevel assignment problems
- 287 Downloads
We consider the bilevel assignment problem in which each decision maker (i.e., the leader and the follower) has its own objective function and controls a distinct set of edges in a given bipartite graph. The leader acts first by choosing some of its edges. Subsequently, the follower completes the assignment process. The edges selected by the leader and the follower are required to constitute a perfect matching. In this paper we propose an exact solution approach, which is based on a branch-and-bound framework and exploits structural properties of the assignment problem. Extensive computational experiments with linear sum and linear bottleneck objective functions are conducted to demonstrate the performance of the developed methods. While the considered problem is known to be NP-hard in general, we also describe some restricted cases that can be solved in polynomial time.
KeywordsBilevel programming Assignment problem Combinatorial optimization
The authors would like to thank the Associate Editor and the anonymous reviewers for their constructive comments that helped us to greatly improve the quality of the paper. This material is based upon work supported by the U.S. Air Force Research Laboratory (AFRL) Mathematical Modeling and Optimization Institute and the U.S. Air Force Office of Scientific Research (AFOSR). The research of the second author was also supported by the U.S. Air Force Summer Faculty Fellowship and by AFRL/RW under agreement number FA8651-12-2-0008. The U.S. Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of AFRL/RW or the U.S. Government.