Search Results - subject:"Multiple knapsack problem"

A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem

Avci, Mustafa; Topaloglu, Seyda - In: Computers & operations research : and their … 83 (2017), pp. 54-65

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

Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem

Tönissen, D. D.; Akker, J. M. van den; Hoogeveen, J. A. - In: Computers & operations research : and their … 83 (2017), pp. 125-139

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

Online algorithms with advice for the dual bin packing problem

Renault, Marc P. - In: Central European journal of operations research : CEJOR … 25 (2017) 4, pp. 953-966

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

An application of the multiple knapsack problem : the self-sufficient marine

Simon, Jay; Apte, Aruna; Regnier, Eva - In: European journal of operational research : EJOR 256 (2017) 3, pp. 868-876

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

Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem

Qin, Jin; Xu, Xianhao; Wu, Qinghua; Cheng, T. C. E. - In: Computers & operations research : and their … 66 (2016), pp. 199-214

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

An ejection chain approach for the quadratic multiple knapsack problem

Wang, Haibo; Liu, Mengqi; Lü, Zhipeng; Kochberger, Gary; … - In: European journal of operational research : EJOR 253 (2016) 2, pp. 328-336

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

Upper and lower bounding procedures for the multiple knapsack assignment problem

Kataoka, Seiji; Yamada, Takeo - In: European Journal of Operational Research 237 (2014) 2, pp. 440-447

We formulate the multiple knapsack assignment problem (MKAP) as an extension of the multiple knapsack problem (MKP), as …

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

Tabu-enhanced iterated greedy algorithm: A case study in the quadratic multiple knapsack problem

García-Martínez, C.; Rodriguez, F.J.; Lozano, M. - In: European Journal of Operational Research 232 (2014) 3, pp. 454-463

Iterated greedy search is a simple and effective metaheuristic for combinatorial problems. Its flexibility enables the incorporation of components from other metaheuristics with the aim of obtaining effective and powerful hybrid approaches. We propose a tabu-enhanced destruction mechanism for...

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

Strategic oscillation for the quadratic multiple knapsack problem

García-Martínez, Carlos; Glover, Fred; Rodriguez, … - In: Computational Optimization and Applications 58 (2014) 1, pp. 161-185

The quadratic multiple knapsack problem (QMKP) consists in assigning a set of objects, which interact through paired … memory-based methodology. We apply strategic oscillation to the quadratic multiple knapsack problem, disclosing that SO …

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

Generalized quadratic multiple knapsack problem and two solution approaches

Saraç, Tugba; Sipahioglu, Aydin - In: Computers & operations research : and their … 43 (2014), pp. 78-89

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