Search Results - subject:"branch and bound"

Machine learning for combinatorial optimization : a methodological tour d'horizon

Bengio, Yoshua; Lodi, Andrea; Prouvost, Antoine - In: European journal of operational research : EJOR 290 (2021) 2, pp. 405-421

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

Due-window assignment scheduling problem with stochastic processing times

Yue, Qing; Zhou, Shenghai - In: European journal of operational research : EJOR 290 (2021) 2, pp. 453-468

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

Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem

Li, Zixiang; Kucukkoc, Ibrahim; Tang, Qiuhua - In: Computers & operations research : and their … 131 (2021), pp. 1-9

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

MIP approaches for a lot sizing and scheduling problem on multiple production lines with scarce resources, temporary workstations, and perishable products

Soler, Willy A. O.; Santos, Maristela Oliveira; … - In: Journal of the Operational Research Society 72 (2021) 8, pp. 1691-1706

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

An enhanced branch-and-bound algorithm for bilevel integer linear programming

Liu, Shaonan; Wang, Mingzheng; Kong, Nan; Hu, Xiangpei - In: European journal of operational research : EJOR 291 (2021) 2, pp. 661-679

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

Multivariable branching : a 0-1 knapsack problem case study

Yang, Yu; Boland, Natashia; Savelsbergh, Martin W. P. - In: INFORMS journal on computing : JOC 33 (2021) 4, pp. 1354-1367

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

A branch-and-bound algorithm for building optimal data gathering tree in wireless sensor networks

Zhu, Xiaojun; Tang, Shaojie - In: INFORMS journal on computing : JOC 33 (2021) 4, pp. 1446-1460

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

A vehicle routing problem with multiple service agreements

Karels, Vincent C. G.; Rei, Walter; Veelenturf, Lucas P.; … - In: European journal of operational research : EJOR 313 (2024) 1, pp. 129-145

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

Augmenting bi-objective branch and bound by scalarization-based information

Bauß, Julius; Stiglmayr, Michael - In: Mathematical Methods of Operations Research 100 (2024) 1, pp. 85-121

While branch and bound based algorithms are a standard approach to solve single-objective (mixed-)integer optimization … problems, multi-objective branch and bound methods are only rarely applied compared to the predominant objective space methods …. In this paper we propose modifications to increase the performance of multi-objective branch and bound algorithms by …

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

Scheduling a single machine with multiple due dates per job

Kühn, Raphael; Weiß, Christian; Ackermann, Heiner; … - In: Journal of Scheduling 27 (2024) 6, pp. 565-585

provide several polynomially solvable special cases as well as an exact branch-and-bound algorithm and heuristics for the … general case. Experiments show that our branch-and-bound algorithm compares well to modern exact methods to solve problem 1∣rj,pj=p∣∑wjTj. …

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