Narrow search
Showing 1 - 10 of 123
Cover Image
A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem
Ünal, Ali Nadi; Kayakutlu, Gülgün - In: RAIRO / Operations research 50 (2016) 1, pp. 47-66
Persistent link: https://www.econbiz.de/10011641429
Cover Image
Lagrangean relaxation and hybrid simulated annealing tabu search procedure for a two-echelon capacitated facility location problem with plant size selection
Wu, Tingying; Chu, Feng; Yang, Zhen; Zhou, Zhili; Zhou, Wei - In: International journal of production research 55 (2017) 9/10, pp. 2540-2555
Persistent link: https://www.econbiz.de/10011648961
Cover Image
A core-based exact algorithm for the multidimensional multiple choice knapsack problem
Mansini, Renata; Zanotti, Roberto - In: INFORMS journal on computing : JOC 32 (2020) 4, pp. 1061-1079
Persistent link: https://www.econbiz.de/10012390185
Cover Image
A branch & bound algorithm for cutting and packing irregularly shaped pieces
Alvarez-Valdes, Ramon; Martinez, A.; Tamarit, J. M. - In: International journal of production economics 145 (2013) 2, pp. 463-477
Persistent link: https://www.econbiz.de/10010187908
Cover Image
A variable neighborhood search algorithm to generate piano fingerings for polyphonic sheet music
Balliauw, Matteo; Herremans, Dorien; Palhazi Cuervo, Daniel - In: International transactions in operational research : … 24 (2017) 3, pp. 509-535
Persistent link: https://www.econbiz.de/10011724428
Cover Image
Contributions to exact approaches in combinatorial optimization
Gschwind, Timo - 2014
The focus of this thesis is to contribute to the development of new, exact solution approaches to different combinatorial optimization problems. In particular, we derive dedicated algorithms for a special class of Traveling Tournament Problems (TTPs), the Dial-A-Ride Problem (DARP), and the...
Persistent link: https://www.econbiz.de/10010512631
Cover Image
A decomposition based solution algorithm for u-type assembly line balancing with interval data
Hazır, Öncü; Dolgui, Alexandre - In: Computers & operations research : and their … 59 (2015), pp. 126-131
Persistent link: https://www.econbiz.de/10010515208
Cover Image
Achieving domain consistency and counting solutions for dispersion constraints
Pesant, Gilles - In: INFORMS journal on computing : JOC 27 (2015) 4, pp. 690-703
Persistent link: https://www.econbiz.de/10011422666
Cover Image
Computational results of a semidefinite branch-and-bound algorithm for k-cluster
Krislock, Nathan; Malick, Jérôme; Roupin, Frédéric - In: Computers & operations research : and their … 66 (2016), pp. 153-159
Persistent link: https://www.econbiz.de/10011429002
Cover Image
Dimensionality reduction in multiobjective shortest path search
Pulido, Francisco-Javier; Mandow, Lawrence; … - In: Computers & operations research : and their … 64 (2015), pp. 60-70
Persistent link: https://www.econbiz.de/10011373451