Similar Search Results

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://ebvufind01.dmz1.zbw.eu/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://ebvufind01.dmz1.zbw.eu/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://ebvufind01.dmz1.zbw.eu/10011656244

Revisiting the Hamiltonian p-median problem : a new formulation on directed graphs and a branch-and-cut algorithm

Bektaş, Tolga; Gouveia, Luís; Santos, Daniel - In: European journal of operational research : EJOR 276 (2019) 1, pp. 40-64

Persistent link: https://ebvufind01.dmz1.zbw.eu/10011997853

Combinatorial Benders cuts for assembly line balancing problems with setups

Akpinar, Sener; Elmi, Atabak; Bektaş, Tolga - In: European journal of operational research : EJOR 259 (2017) 2, pp. 527-537

Persistent link: https://ebvufind01.dmz1.zbw.eu/10011661554