Narrow search
Showing 1 - 10 of 49
Cover Image
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
solve a set of 126 multidemand multidimensional knapsack problem (MDMKP) instances. We solve the resulting CPs using two …
Persistent link: https://www.econbiz.de/10012596505
Cover Image
A branch & bound algorithm for cutting and packing irregularly shaped pieces
Alvarez-Valdes, Ramon; Martinez, A.; Tamarit, J. M. - In: International journal of production economics 145 (2013) 2, pp. 463-477
Persistent link: https://www.econbiz.de/10010187908
Cover Image
A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
Legato, Pasquale; Trunfio, Roberto - In: 4OR : a quarterly journal of operations research 12 (2014) 2, pp. 123-156
Persistent link: https://www.econbiz.de/10010438106
Cover Image
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
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
Branch-and-bound and dynamic programming approaches for the knapsack problem
Burashnikov, Evgenii - In: Operations research forum 5 (2024) 4, pp. 1-19
Persistent link: https://www.econbiz.de/10015182041
Cover Image
Single-machine scheduling simultaneous consideration of resource allocations and exponential time-dependent learning effects
Zhang, Yurong; Sun, Xinyu; Liu, Tao; Wang, Jiayin; … - In: Journal of the Operational Research Society 76 (2025) 3, pp. 528-540
Persistent link: https://www.econbiz.de/10015325337
Cover Image
An exact cutting plane method for the Euclidean max-sum diversity problem
Spiers, Sandy; Bui, Hoa T.; Loxton, Ryan - In: European journal of operational research : EJOR 311 (2023) 2, pp. 444-454
Persistent link: https://www.econbiz.de/10014336550
Cover Image
Upper and lower bounding procedures for the multiple knapsack assignment problem
Kataoka, Seiji; Yamada, Takeo - In: European journal of operational research : EJOR 237 (2014) 2, pp. 440-447
Persistent link: https://www.econbiz.de/10010380013
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