IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v65y2017i6p1615-1637.html
   My bibliography  Save this item

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs

Citations

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


Cited by:

  1. Egerer, Jonas & Grimm, Veronika & Kleinert, Thomas & Schmidt, Martin & Zöttl, Gregor, 2021. "The impact of neighboring markets on renewable locations, transmission expansion, and generation investment," European Journal of Operational Research, Elsevier, vol. 292(2), pages 696-713.
  2. Wang, Jinpei & Bai, Xuejie & Liu, Yankui, 2023. "Globalized robust bilevel optimization model for hazmat transport network design considering reliability," Reliability Engineering and System Safety, Elsevier, vol. 239(C).
  3. Tanınmış, Kübra & Aras, Necati & Altınel, İ. Kuban, 2022. "Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks," European Journal of Operational Research, Elsevier, vol. 297(1), pages 40-52.
  4. Rahman Khorramfar & Osman Y. Özaltın & Karl G. Kempf & Reha Uzsoy, 2022. "Managing Product Transitions: A Bilevel Programming Approach," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2828-2844, September.
  5. Soares, Inês & Alves, Maria João & Henggeler Antunes, Carlos, 2021. "A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem," European Journal of Operational Research, Elsevier, vol. 291(1), pages 52-66.
  6. Kosmas, Daniel & Sharkey, Thomas C. & Mitchell, John E. & Maass, Kayse Lee & Martin, Lauren, 2023. "Interdicting restructuring networks with applications in illicit trafficking," European Journal of Operational Research, Elsevier, vol. 308(2), pages 832-851.
  7. Andrea Baggio & Margarida Carvalho & Andrea Lodi & Andrea Tramontani, 2021. "Multilevel Approaches for the Critical Node Problem," Operations Research, INFORMS, vol. 69(2), pages 486-508, March.
  8. Geunyeong Byeon & Pascal Van Hentenryck, 2022. "Benders Subproblem Decomposition for Bilevel Problems with Convex Follower," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1749-1767, May.
  9. 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.
  10. Liu, Shaonan & Wang, Mingzheng & Kong, Nan & Hu, Xiangpei, 2021. "An enhanced branch-and-bound algorithm for bilevel integer linear programming," European Journal of Operational Research, Elsevier, vol. 291(2), pages 661-679.
  11. Coniglio, Stefano & Furini, Fabio & San Segundo, Pablo, 2021. "A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts," European Journal of Operational Research, Elsevier, vol. 289(2), pages 435-455.
  12. Thomas Kleinert & Martin Schmidt, 2023. "Why there is no need to use a big-M in linear bilevel optimization: a computational study of two ready-to-use approaches," Computational Management Science, Springer, vol. 20(1), pages 1-12, December.
  13. Yasmine Beck & Daniel Bienstock & Martin Schmidt & Johannes Thürauf, 2023. "On a Computationally Ill-Behaved Bilevel Problem with a Continuous and Nonconvex Lower Level," Journal of Optimization Theory and Applications, Springer, vol. 198(1), pages 428-447, July.
  14. Ambrosius, Mirjam & Grimm, Veronika & Kleinert, Thomas & Liers, Frauke & Schmidt, Martin & Zöttl, Gregor, 2020. "Endogenous price zones and investment incentives in electricity markets: An application of multilevel optimization with graph partitioning," Energy Economics, Elsevier, vol. 92(C).
  15. Gerhard J. Woeginger, 2021. "The trouble with the second quantifier," 4OR, Springer, vol. 19(2), pages 157-181, June.
  16. 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.
  17. Juan S. Borrero & Leonardo Lozano, 2021. "Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1570-1589, October.
  18. Quang Minh Bui & Bernard Gendron & Margarida Carvalho, 2022. "A Catalog of Formulations for the Network Pricing Problem," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2658-2674, September.
  19. Junlong Zhang & Osman Y. Özaltın, 2021. "Bilevel Integer Programs with Stochastic Right-Hand Sides," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1644-1660, October.
  20. Nascimento, Paulo Jorge & Silva, Cristóvão & Antunes, Carlos Henggeler & Moniz, Samuel, 2024. "Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems," European Journal of Operational Research, Elsevier, vol. 317(1), pages 92-110.
  21. George Kozanidis & Eftychia Kostarelou, 2023. "An Exact Solution Algorithm for Integer Bilevel Programming with Application in Energy Market Optimization," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 573-607, May.
  22. Holger Heitsch & René Henrion & Thomas Kleinert & Martin Schmidt, 2022. "On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints," Journal of Global Optimization, Springer, vol. 84(3), pages 651-685, November.
  23. Böttger, T. & Grimm, V. & Kleinert, T. & Schmidt, M., 2022. "The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling," European Journal of Operational Research, Elsevier, vol. 297(3), pages 1095-1111.
  24. Claudio Contardo & Jorge A. Sefair, 2022. "A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 890-908, March.
  25. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
  26. Lüer-Villagra, Armin & Marianov, Vladimir & Eiselt, H.A. & Méndez-Vogel, Gonzalo, 2022. "The leader multipurpose shopping location problem," European Journal of Operational Research, Elsevier, vol. 302(2), pages 470-481.
  27. Moon, Kyungduk & Lee, Kangbok & Chopra, Sunil & Kwon, Steve, 2022. "Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy," European Journal of Operational Research, Elsevier, vol. 300(2), pages 743-754.
  28. Chai, Simin & Yin, Jiateng & D’Ariano, Andrea & Liu, Ronghui & Yang, Lixing & Tang, Tao, 2024. "A branch-and-cut algorithm for scheduling train platoons in urban rail networks," Transportation Research Part B: Methodological, Elsevier, vol. 181(C).
  29. Kübra Tanınmış & Markus Sinnl, 2022. "A Branch-and-Cut Algorithm for Submodular Interdiction Games," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2634-2657, September.
  30. Leitner, Markus & Ljubić, Ivana & Monaci, Michele & Sinnl, Markus & Tanınmış, Kübra, 2023. "An exact method for binary fortification games," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1026-1039.
  31. Tayyebi, Javad & Mitra, Ankan & Sefair, Jorge A., 2023. "The continuous maximum capacity path interdiction problem," European Journal of Operational Research, Elsevier, vol. 305(1), pages 38-52.
  32. Liu, Shaonan & Kong, Nan & Parikh, Pratik & Wang, Mingzheng, 2023. "Optimal trauma care network redesign with government subsidy: A bilevel integer programming approach," Omega, Elsevier, vol. 119(C).
  33. Mehdi Ansari & Juan S. Borrero & Leonardo Lozano, 2023. "Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 83-103, January.
  34. Foad Mahdavi Pajouh, 2020. "Minimum cost edge blocker clique problem," Annals of Operations Research, Springer, vol. 294(1), pages 345-376, November.
  35. Fischetti, Matteo & Monaci, Michele & Sinnl, Markus, 2018. "A dynamic reformulation heuristic for Generalized Interdiction Problems," European Journal of Operational Research, Elsevier, vol. 267(1), pages 40-51.
  36. Furini, Fabio & Ljubić, Ivana & San Segundo, Pablo & Zhao, Yanlu, 2021. "A branch-and-cut algorithm for the Edge Interdiction Clique Problem," European Journal of Operational Research, Elsevier, vol. 294(1), pages 54-69.
  37. Thomas Kleinert & Martin Schmidt, 2021. "Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 198-215, January.
  38. Maximilian Merkert & Galina Orlinskaya & Dieter Weninger, 2022. "An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities," Journal of Global Optimization, Springer, vol. 84(3), pages 607-650, November.
  39. Furini, Fabio & Ljubić, Ivana & Martin, Sébastien & San Segundo, Pablo, 2019. "The maximum clique interdiction problem," European Journal of Operational Research, Elsevier, vol. 277(1), pages 112-127.
  40. Santos, Maria João & Curcio, Eduardo & Amorim, Pedro & Carvalho, Margarida & Marques, Alexandra, 2021. "A bilevel approach for the collaborative transportation planning problem," International Journal of Production Economics, Elsevier, vol. 233(C).
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.