Similar Search Results

A note on "an exact algorithm for the blocks relocation problem with new lower bounds"

Jin, Bo - In: Computers & operations research : and their … 124 (2020), pp. 1-7

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

An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem

Dubois-Lacoste, Jérémie; Pagnozzi, Federico; … - In: Computers & operations research : and their … 81 (2017), pp. 160-166

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

Scalability of using restricted Boltzmann machines for combinatorial optimization

Probst, Malte; Rothlauf, Franz; Grahl, Jörn - In: European journal of operational research : EJOR 256 (2017) 2, pp. 368-383

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

An exact algorithm for the block relocation problem with a stowage plan

Tanaka, Shunji; Voß, Stefan - In: European journal of operational research : EJOR 279 (2019) 3, pp. 767-781

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

A project scheduling problem with spatial resource constraints and a corresponding guided local search algorithm

Hu, Shicheng; Zhang, Zhaoze; Wang, Song; Kao, Yonggui; … - In: Journal of the Operational Research Society 70 (2019) 8, pp. 1349-1361

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

An improved ant colony system for the sequential ordering problem

Skinderowicz, Rafał - In: Computers & operations research : and their … 86 (2017), pp. 1-17

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

Parallel iterative solution-based tabu search for the obnoxious p-median problem

Chang, Jian; Wang, Lifang; Hao, Jin-Kao; Wang, Yang - In: Computers & operations research : and their … 127 (2021), pp. 1-10

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

Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems with additional constraints

Pagnozzi, Federico; Stützle, Thomas G. - In: Operations research perspectives 8 (2021), pp. 1-17

Automatic design of stochastic local search algorithms has been shown to be very effective in generating algorithms for the permutation flowshop problem for the most studied objectives including makespan, flowtime and total tardiness. The automatic design system uses a configuration tool to...

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

A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem

Hifi, Mhand; Sadeghsa, Shohre - In: Journal of the Operational Research Society 74 (2023) 1, pp. 258-271

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

Exact and approximate methods for the score-constrained packing problem

Hawa, Asyl L.; Lewis, Rhyd; Thompson, Jonathan M. - In: European journal of operational research : EJOR 302 (2022) 3, pp. 847-859

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