Similar Search Results

An algorithmic framework for the exact solution of tree-star problems

Leitner, Markus; Ljubić, Ivana; Salazar-González, … - In: European journal of operational research : EJOR 261 (2017) 1, pp. 54-66

Persistent link: https://www.econbiz.de/10011764100

An exact method for binary fortification games

Leitner, Markus; Ljubić, Ivana; Monaci, Michele; … - In: European journal of operational research : EJOR 307 (2023) 3, pp. 1026-1039

Persistent link: https://www.econbiz.de/10014282936

Improved integer linear programming formulations for the job Sequencing and tool Switching Problem

Catanzaro, Daniele; Gouveia, Luis; Labbé, Martine - In: European Journal of Operational Research 244 (2015) 3, pp. 766-777

In this article we investigate the job Sequencing and tool Switching Problem (SSP), a NP-hard combinatorial optimization problem arising from computer and manufacturing systems. Starting from the results described in Tang and Denardo (1987), Crama et al. (1994) and Laporte et al. (2004), we...

Persistent link: https://www.econbiz.de/10011264319

Improved integer linear programming formulations for the job sequencing and tool switching problem

Catanzaro, Daniele; Gouveia, Luis; Labbé, Martine - In: European journal of operational research : EJOR 244 (2015) 3, pp. 766-777

Persistent link: https://www.econbiz.de/10011289941

Spanning trees with a constraint on the number of leaves. A new formulation

Gouveia, Luis; Simonetti, Luidi - In: Computers & operations research : and their … 81 (2017), pp. 257-268

Persistent link: https://www.econbiz.de/10011656244

Benders decomposition for very large scale partial set covering and maximal covering location problems

Cordeau, Jean-François; Furini, Fabio; Ljubić, Ivana - In: European journal of operational research : EJOR 275 (2019) 3, pp. 882-896

Persistent link: https://www.econbiz.de/10011993607

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

Outer approximation and submodular cuts for maximum capture facility location problems with random utilities

Ljubić, Ivana; Moreno, Eduardo - In: European journal of operational research : EJOR 266 (2018) 1, pp. 46-56

Persistent link: https://www.econbiz.de/10011811571

An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem

Furini, Fabio; Ljubić, Ivana; Sinnl, Markus - In: European journal of operational research : EJOR 262 (2017) 2, pp. 438-448

Persistent link: https://www.econbiz.de/10011798731

The maximum clique interdiction problem

Furini, Fabio; Ljubić, Ivana; Martin, Sébastien; San … - In: European journal of operational research : EJOR 277 (2019) 1, pp. 112-127

Persistent link: https://www.econbiz.de/10012014820