Narrow search
Showing 1 - 10 of 755,229
Cover Image
An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules
Jin, Bo; Tanaka, Shunji - In: European journal of operational research : EJOR 304 (2023) 2, pp. 494-514
Persistent link: https://www.econbiz.de/10013534536
Cover Image
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
Cover Image
An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints
Pamuk, Bahadır; Öncan, Temel; Altınel, İ. Kuban - In: European journal of operational research : EJOR 324 (2025) 2, pp. 398-413
Persistent link: https://www.econbiz.de/10015433055
Cover Image
A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan
Ozturk, Onur; Begen, Mehmet A.; Zaric, Gregory S. - In: International journal of production research 55 (2017) 5/6, pp. 1815-1831
Persistent link: https://www.econbiz.de/10011628422
Cover Image
An exact algorithm to minimize mean squared deviation of job completion times about a common due date
Srirangacharyulu, B.; Srinivasan, G. - In: European journal of operational research : EJOR 231 (2013) 3, pp. 547-556
Persistent link: https://www.econbiz.de/10009787396
Cover Image
An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
Morrison, David Robert; Sewell, Edward C.; Jacobson, … - In: European journal of operational research : EJOR 236 (2014) 2, pp. 403-409
Persistent link: https://www.econbiz.de/10010366188
Cover Image
A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization
Cordone, Roberto; Hosteins, Pierre; Righini, Giovanni - In: INFORMS journal on computing : JOC 30 (2018) 1, pp. 168-180
Persistent link: https://www.econbiz.de/10011848225
Cover Image
An improved branch-and-bound algorithm for the one-machine scheduling problem with delayed precedence constraints
Zhang, Wenda; Sauppe, Jason J.; Jacobson, Sheldon H. - In: INFORMS journal on computing : JOC 33 (2021) 3, pp. 1091-1102
Persistent link: https://www.econbiz.de/10012631649
Cover Image
Branch, bound and remember algorithm for two-sided assembly line balancing problem
Li, Zixiang; Kucukkoc, Ibrahim; Zhang, Zikai - In: European journal of operational research : EJOR 284 (2020) 3, pp. 896-905
Persistent link: https://www.econbiz.de/10012238919
Cover Image
A new approximation algorithm for unrelated parallel machine scheduling with release dates
Pei, Zhi; Wan, Mingzhong; Wang, Ziteng - In: Project management and scheduling, (pp. 397-425). 2020
Persistent link: https://www.econbiz.de/10012157366