Narrow search
Showing 71 - 80 of 708
Cover Image
A new upper bound for the maximum weight clique problem
Li, Chu-Min; Liu, Yanli; Jiang, Hua; Manyà, Felip; Li, Yu - In: European journal of operational research : EJOR 270 (2018) 1, pp. 66-77
Persistent link: https://www.econbiz.de/10011868925
Cover Image
A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
Wei, Lijun; Hu, Qian; Lim, Andrew; Liu, Qiang - In: European journal of operational research : EJOR 270 (2018) 2, pp. 448-474
Persistent link: https://www.econbiz.de/10011869044
Cover Image
Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks
Wu, Lingxiao; Wang, Shuaian - In: International journal of production economics 201 (2018), pp. 26-40
Persistent link: https://www.econbiz.de/10011870126
Cover Image
A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem
Álvarez-Miranda, Eduardo; Pereira, Jordi; Vilà, Mariona - In: Computers & operations research : an international journal 166 (2024), pp. 1-16
Persistent link: https://www.econbiz.de/10014563804
Cover Image
Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop
Jafari-Nodoushan, Abbasali; Zare, Hassan Khademi; … - In: Operations research forum 2 (2021) 4, pp. 1-29
Persistent link: https://www.econbiz.de/10012663044
Cover Image
Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
Forget, Nicolas; Gadegaard, Sune Lauth; Nielsen, Lars Relund - In: European journal of operational research : EJOR 302 (2022) 3, pp. 909-924
Persistent link: https://www.econbiz.de/10013363797
Cover Image
Competitive bi-agent flowshop scheduling to minimise the weighted combination of makespans
Bai, Danyu; Diabat, Ali; Wang, Xinyue; Yang, Dandan; Fu, Yao - In: International journal of production research 60 (2022) 22, pp. 6750-6771
Persistent link: https://www.econbiz.de/10013501121
Cover Image
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
Yang, Yu; Boland, Natashia; Dilkina, Bistra; … - In: European journal of operational research : EJOR 301 (2022) 3, pp. 828-840
Persistent link: https://www.econbiz.de/10013267791
Cover Image
A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem
Dell'Amico, Mauro; Jamal, Jafar; Montemanni, Roberto - In: Computers & operations research : and their … 156 (2023), pp. 1-9
Persistent link: https://www.econbiz.de/10014373676
Cover Image
A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
Watermeyer, Kai; Zimmermann, Jürgen - In: Journal of scheduling : JOS 26 (2023) 1, pp. 95-111
Persistent link: https://www.econbiz.de/10014265740