On complexity of finding strong-weak solutions in bilevel linear programming

Tomás Lagos, Oleg A. Prokopyev. On complexity of finding strong-weak solutions in bilevel linear programming. Oper. Res. Lett., 51(6):612-617, November 2023. [doi]

@article{LagosP23,
  title = {On complexity of finding strong-weak solutions in bilevel linear programming},
  author = {Tomás Lagos and Oleg A. Prokopyev},
  year = {2023},
  month = {November},
  doi = {10.1016/j.orl.2023.09.011},
  url = {https://doi.org/10.1016/j.orl.2023.09.011},
  researchr = {https://researchr.org/publication/LagosP23},
  cites = {0},
  citedby = {0},
  journal = {Oper. Res. Lett.},
  volume = {51},
  number = {6},
  pages = {612-617},
}