Narrow search
Showing 1 - 10 of 12,234
Cover Image
A new heuristic formulation for a competitive maximal covering location problem
Seyhan, Tolga H.; Snyder, Lawrence V.; Zhang, Ying - In: Transportation science : a journal of the Institute for … 52 (2018) 5, pp. 1156-1173
Persistent link: https://www.econbiz.de/10011937968
Cover Image
When Nash meets Stackelberg
Carvalho, Margarida; Dragotto, Gabriele; Feijoo, Felipe; … - In: Management science : journal of the Institute for … 70 (2024) 10, pp. 7308-7324
Persistent link: https://www.econbiz.de/10015143875
Cover Image
The zero regrets algorithm : optimizing over pure nash equilibria via integer programming
Dragotto, Gabriele; Scatamacchia, Rosario - In: INFORMS journal on computing : JOC ; charting new … 35 (2023) 5, pp. 1143-1160
Persistent link: https://www.econbiz.de/10014423012
Cover Image
Design and control of public-service contracts and an application to public transportation systems
Lodi, Andrea; Malaguti, Enrico; Stier-Moses, Nicolás E.; … - In: Management science : journal of the Institute for … 62 (2016) 4, pp. 1165-1187
Persistent link: https://www.econbiz.de/10011470677
Cover Image
The maximal covering location disruption problem
Lunday, Brian J. - In: Computers & operations research : an international journal 169 (2024), pp. 1-16
Persistent link: https://www.econbiz.de/10015065852
Cover Image
The integer nucleolus of directed simple games : a characterization and an algorithm
Wolff, Reiner - In: Games 8 (2017) 1, pp. 1-12
integer imputations that weakly preserve the desirability relation between the players. We propose an algorithm for finding … the integer nucleolus of any directed simple game with a nonempty integer imputation set. The algorithm supports the …
Persistent link: https://www.econbiz.de/10011621467
Cover Image
Computing equilibria for integer programming games
Carvalho, Margarida; Lodi, Andrea; Pedroso, João Pedro - In: European journal of operational research : EJOR 303 (2022) 3, pp. 1057-1070
Persistent link: https://www.econbiz.de/10013366182
Cover Image
A branch-and-cut algorithm for submodular interdiction games
Tanınmış, Kübra; Sinnl, Markus - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 5, pp. 2634-2657
Persistent link: https://www.econbiz.de/10014325544
Cover Image
Stable set reformulations for the degree preserving spanning tree problem
Lucena, Abílio; Cunha, Alexandre Salles da - In: European journal of operational research : EJOR 319 (2024) 1, pp. 50-61
Persistent link: https://www.econbiz.de/10015083522