Similar Search Results

On the hop-constrained survivable network design problem with reliable edges

Botton, Quentin; Fortz, Bernard; Gouveia, Luis - In: Computers & operations research : and their … 64 (2015), pp. 159-167

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

Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing

Bektaş, Tolga - In: European Journal of Operational Research 216 (2012) 1, pp. 83-93

This paper describes new models and exact solution algorithms for the fixed destination multidepot salesmen problem defined on a graph with n nodes where the number of nodes each salesman is to visit is restricted to be in a predefined range. Such problems arise when the time to visit a node...

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

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

Multicommodity flows and Benders decomposition for restricted continuous location problems

Oğuz, Murat; Bektaş, Tolga; Bennell, Julia A. - In: European journal of operational research : EJOR 266 (2018) 3, pp. 851-863

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

Benders decomposition for the mixed no-idle permutation flowshop scheduling problem

Bektaş, Tolga; Hamzadayı, Alper; Ruiz, Rubén - In: Journal of scheduling : JOS 23 (2020) 4, pp. 513-523

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