Narrow search
Showing 1 - 10 of 52
Cover Image
A note on computational aspects of the Steiner traveling salesman problem
Álvarez-Miranda, Eduardo; Sinnl, Markus - In: International Transactions in Operational Research 26 (2018) 4, pp. 1396-1401
Persistent link: https://www.econbiz.de/10012091825
Cover Image
Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
Álvarez-Miranda, Eduardo; Sinnl, Markus - In: Computers & operations research : and their … 83 (2017), pp. 13-27
Persistent link: https://www.econbiz.de/10011700512
Cover Image
Solving minimum-cost shared arborescence problems
Álvarez-Miranda, Eduardo; Ljubić, Ivana; Luipersbeck, … - In: European journal of operational research : EJOR 258 (2017) 3, pp. 887-901
Persistent link: https://www.econbiz.de/10011644500
Cover Image
An exact solution framework for the multiple gradual cover location problem
Álvarez-Miranda, Eduardo; Sinnl, Markus - In: Computers & operations research : and their … 108 (2019), pp. 82-96
Persistent link: https://www.econbiz.de/10012064945
Cover Image
Gotta (efficiently) catch them all : Pokémon GO meets orienteering problems
Álvarez-Miranda, Eduardo; Luipersbeck, Martin; Sinnl, … - In: European journal of operational research : EJOR 265 (2018) 2, pp. 779-794
Persistent link: https://www.econbiz.de/10011811498
Cover Image
A branch-and-cut algorithm for the maximum covering cycle problem
Álvarez-Miranda, Eduardo; Sinnl, Markus - In: Decomposition methods for hard optimization problems, (pp. 487-499). 2020
Persistent link: https://www.econbiz.de/10012157107
Cover Image
A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death
Álvarez-Miranda, Eduardo; Farhan, Hesso; Luipersbeck, … - In: Operations research in neuroscience, (pp. 5-30). 2017
Persistent link: https://www.econbiz.de/10011763160
Cover Image
A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems
Álvarez-Miranda, Eduardo; Sinnl, Markus - In: Computers & operations research : and their … 87 (2017), pp. 63-82
Persistent link: https://www.econbiz.de/10011743361
Cover Image
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements
Álvarez-Miranda, Eduardo; Goycoolea, Marcos; Ljubić, Ivana - In: European journal of operational research : EJOR 289 (2021) 3, pp. 1013-1029
Persistent link: https://www.econbiz.de/10012433323
Cover Image
Mixed-integer programming approaches for the time-constrained maximal covering routing problem
Sinnl, Markus - In: OR spectrum : quantitative approaches in management 43 (2021) 2, pp. 497-542
Persistent link: https://www.econbiz.de/10012585041