IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v64y2016i1d10.1007_s10589-015-9799-4.html
   My bibliography  Save this article

Exact solution approaches for bilevel assignment problems

Author

Listed:
  • Behdad Beheshti

    (University of Pittsburgh)

  • Oleg A. Prokopyev

    (University of Pittsburgh)

  • Eduardo L. Pasiliao

    (AFRL Munitions Directorate)

Abstract

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.

Suggested Citation

  • Behdad Beheshti & Oleg A. Prokopyev & Eduardo L. Pasiliao, 2016. "Exact solution approaches for bilevel assignment problems," Computational Optimization and Applications, Springer, vol. 64(1), pages 215-242, May.
  • Handle: RePEc:spr:coopap:v:64:y:2016:i:1:d:10.1007_s10589-015-9799-4
    DOI: 10.1007/s10589-015-9799-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-015-9799-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10589-015-9799-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Renata M. Aiex & Mauricio G. C. Resende & Panos M. Pardalos & Gerardo Toraldo, 2005. "GRASP with Path Relinking for Three-Index Assignment," INFORMS Journal on Computing, INFORMS, vol. 17(2), pages 224-247, May.
    2. M. L. Balinski & R. E. Gomory, 1964. "A Primal Method for the Assignment and Transportation Problems," Management Science, INFORMS, vol. 10(3), pages 578-593, April.
    3. Benoît Colson & Patrice Marcotte & Gilles Savard, 2007. "An overview of bilevel optimization," Annals of Operations Research, Springer, vol. 153(1), pages 235-256, September.
    4. Liu, Yi-Hsin & Spencer, Thomas H., 1995. "Solving a bilevel linear program when the inner decision maker controls few variables," European Journal of Operational Research, Elsevier, vol. 81(3), pages 644-651, March.
    5. Fred Glover, 1975. "Improved Linear Integer Programming Formulations of Nonlinear Integer Problems," Management Science, INFORMS, vol. 22(4), pages 455-460, December.
    6. Lieshout, P.M.D. & Volgenant, A., 2007. "A branch-and-bound algorithm for the singly constrained assignment problem," European Journal of Operational Research, Elsevier, vol. 176(1), pages 151-164, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gabriel Lopez Zenarosa & Oleg A. Prokopyev & Eduardo L. Pasiliao, 2021. "On exact solution approaches for bilevel quadratic 0–1 knapsack problem," Annals of Operations Research, Springer, vol. 298(1), pages 555-572, March.
    2. M. Hosein Zare & Juan S. Borrero & Bo Zeng & Oleg A. Prokopyev, 2019. "A note on linearized reformulations for a class of bilevel linear integer problems," Annals of Operations Research, Springer, vol. 272(1), pages 99-117, January.
    3. Jorge A. Sefair & J. Cole Smith, 2017. "Exact algorithms and bounds for the dynamic assignment interdiction problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(5), pages 373-387, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nicoletti, Jack & You, Fengqi, 2020. "Multiobjective economic and environmental optimization of global crude oil purchase and sale planning with noncooperative stakeholders," Applied Energy, Elsevier, vol. 259(C).
    2. M. Hosein Zare & Juan S. Borrero & Bo Zeng & Oleg A. Prokopyev, 2019. "A note on linearized reformulations for a class of bilevel linear integer problems," Annals of Operations Research, Springer, vol. 272(1), pages 99-117, January.
    3. Zhao, Ning & You, Fengqi, 2019. "Dairy waste-to-energy incentive policy design using Stackelberg-game-based modeling and optimization," Applied Energy, Elsevier, vol. 254(C).
    4. Dempe, Stephan & Kalashnikov, Vyacheslav V. & Pérez-Valdés, Gerardo A. & Kalashnykova, Nataliya I., 2011. "Natural gas bilevel cash-out problem: Convergence of a penalty function method," European Journal of Operational Research, Elsevier, vol. 215(3), pages 532-538, December.
    5. Carvalho, Margarida & Lodi, Andrea, 2023. "A theoretical and computational equilibria analysis of a multi-player kidney exchange program," European Journal of Operational Research, Elsevier, vol. 305(1), pages 373-385.
    6. Andreas Lanz & Gregor Reich & Ole Wilms, 2022. "Adaptive grids for the estimation of dynamic models," Quantitative Marketing and Economics (QME), Springer, vol. 20(2), pages 179-238, June.
    7. Shi, Yi & Deng, Yawen & Wang, Guoan & Xu, Jiuping, 2020. "Stackelberg equilibrium-based eco-economic approach for sustainable development of kitchen waste disposal with subsidy policy: A case study from China," Energy, Elsevier, vol. 196(C).
    8. Lucio Bianco & Massimiliano Caramia & Stefano Giordani & Veronica Piccialli, 2016. "A Game-Theoretic Approach for Regulating Hazmat Transportation," Transportation Science, INFORMS, vol. 50(2), pages 424-438, May.
    9. M. Köppe & M. Queyranne & C. T. Ryan, 2010. "Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs," Journal of Optimization Theory and Applications, Springer, vol. 146(1), pages 137-150, July.
    10. Xu, Jiuping & Shu, Kejing & Wang, Fengjuan & Yang, Guocan, 2024. "Bi-level multi-objective distribution strategy integrating the permit trading scheme towards coal production capacity layout optimization: Case study from China," Resources Policy, Elsevier, vol. 91(C).
    11. Yokoyama, Ryohei & Kitano, Hiroyuki & Wakui, Tetsuya, 2017. "Optimal operation of heat supply systems with piping network," Energy, Elsevier, vol. 137(C), pages 888-897.
    12. Tian, Xueyu & You, Fengqi, 2019. "Carbon-neutral hybrid energy systems with deep water source cooling, biomass heating, and geothermal heat and power," Applied Energy, Elsevier, vol. 250(C), pages 413-432.
    13. Cerulli, Martina & Serra, Domenico & Sorgente, Carmine & Archetti, Claudia & Ljubić, Ivana, 2023. "Mathematical programming formulations for the Collapsed k-Core Problem," European Journal of Operational Research, Elsevier, vol. 311(1), pages 56-72.
    14. Chan Y. Han & Brian J. Lunday & Matthew J. Robbins, 2016. "A Game Theoretic Model for the Optimal Location of Integrated Air Defense System Missile Batteries," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 405-416, August.
    15. Lorenzo Lampariello & Simone Sagratella, 2015. "It is a matter of hierarchy: a Nash equilibrium problem perspective on bilevel programming," DIAG Technical Reports 2015-07, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    16. Longinidis, Pantelis & Georgiadis, Michael C., 2014. "Integration of sale and leaseback in the optimal design of supply chain networks," Omega, Elsevier, vol. 47(C), pages 73-89.
    17. Rostami, Borzou & Chassein, André & Hopf, Michael & Frey, Davide & Buchheim, Christoph & Malucelli, Federico & Goerigk, Marc, 2018. "The quadratic shortest path problem: complexity, approximability, and solution methods," European Journal of Operational Research, Elsevier, vol. 268(2), pages 473-485.
    18. R. Paulavičius & C. S. Adjiman, 2020. "New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm," Journal of Global Optimization, Springer, vol. 77(2), pages 197-225, June.
    19. Grimm, Veronika & Schewe, Lars & Schmidt, Martin & Zöttl, Gregor, 2017. "Uniqueness of market equilibrium on a network: A peak-load pricing approach," European Journal of Operational Research, Elsevier, vol. 261(3), pages 971-983.
    20. Unai Aldasoro & María Merino & Gloria Pérez, 2019. "Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic," Annals of Operations Research, Springer, vol. 280(1), pages 151-187, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:64:y:2016:i:1:d:10.1007_s10589-015-9799-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.