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

A fast branch, bound and remember algorithm for disassembly line balancing problem

Li, Zixiang; Çil, Zeynel Abidin; Mete, Süleyman; … - In: International journal of production research 58 (2020) 11, pp. 3220-3234

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

Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty

Chassein, André; Goerigk, Marc; Kurtz, Jannis; Poss, … - In: European journal of operational research : EJOR 279 (2019) 2, pp. 308-319

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

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 new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts

Coniglio, Stefano; Furini, Fabio; San Segundo, Pablo - In: European journal of operational research : EJOR 289 (2021) 2, pp. 435-455

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

A novel core-based optimization framework for binary integer programs- the multidemand multidimesional Knapsack problem as a test problem

Al-Shihabi, Sameh - In: Operations research perspectives 8 (2021), pp. 1-13

The effectiveness and efficiency of optimization algorithms might deteriorate when solving large-scale binary integer programs (BIPs). Consequently, researchers have tried to fix the values of certain variables called adjunct variables, and only optimize a small problem version formed from the...

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

Branch-Relax-and-Check : a tractable decomposition method for order acceptance and identical parallel machine scheduling

Naderi, Bahman; Roshanaei, Vahid - In: European journal of operational research : EJOR 286 (2020) 3, pp. 811-827

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

Branch-and-bound and objective branching with three or more objectives

Forget, Nicolas; Gadegaard, Sune Lauth; Klamroth, Kathrin; … - In: Computers & operations research : and their … 148 (2022), pp. 1-16

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

A massively parallel branch-&-bound algorithm for the balanced minimum evolution problem

Catanzaro, Daniele; Frohn, Martin; Gascuel, Olivier; … - In: Computers & operations research : and their … 158 (2023), pp. 1-17

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

A robust optimization approach for the unrelated parallel machine scheduling problem

Vega, Jonathan de la; Moreno, Alfredo; Morabito, Reinaldo; … - In: Top : an official journal of the Spanish Society of … 31 (2023) 1, pp. 31-66

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