Narrow search
Showing 1 - 10 of 10
Cover Image
Assignment problem with conflicts
Öncan, Temel; Şuvak, Zeynep; Akyüz, M. Hakan; … - In: Computers & operations research : and their … 111 (2019), pp. 214-229
Persistent link: https://www.econbiz.de/10012098165
Cover Image
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo; Coniglio, Stefano; Furini, Fabio; … - In: European journal of operational research : EJOR 278 (2019) 1, pp. 76-90
Persistent link: https://www.econbiz.de/10012102594
Cover Image
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
Li, Chu-Min; Jiang, Hua; Manyà, Felip - In: Computers & operations research : and their … 84 (2017), pp. 1-15
Persistent link: https://www.econbiz.de/10011710166
Cover Image
Exact solution of hub network design problems with profits
Alibeyg, Armaghan; Contreras, Ivan; Fernández, Elena - In: European journal of operational research : EJOR 266 (2018) 1, pp. 57-71
Persistent link: https://www.econbiz.de/10011811573
Cover Image
A branch-and-bound algorithm for assembly line worker assignment and balancing problems
Vilà, Mariona; Pereira, Jordi - In: Computers & operations research : and their … 44 (2014), pp. 105-114
Persistent link: https://www.econbiz.de/10010241366
Cover Image
Improved approaches to solve the one-to-one SkewGraM problem
Sidi, Mohamed Lemine Ahmed; Bocquillon, Ronan; Babou, … - In: Computers & operations research : and their … 138 (2022), pp. 1-8
Persistent link: https://www.econbiz.de/10013040906
Cover Image
Pre-processing a container yard under limited available time
Zweers, Bernard G.; Bhulai, Sandjai; Mei, Rob d. van der - In: Computers & operations research : and their … 123 (2020), pp. 1-19
Persistent link: https://www.econbiz.de/10012286329
Cover Image
SALSA : combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing
Walter, Rico; Schulze, Philipp; Scholl, Armin - In: European journal of operational research : EJOR 295 (2021) 3, pp. 857-873
Persistent link: https://www.econbiz.de/10012622412
Cover Image
Lower bound on size of branch-and-bound trees for solving lot-sizing problem
Dey, Santanu S.; Shah, Prachi - In: Operations research letters 50 (2022) 5, pp. 430-433
Persistent link: https://www.econbiz.de/10013449398
Cover Image
A branch-and-bound algorithm for the quadratic multiple knapsack problem
Fleszar, Krzysztof - In: European journal of operational research : EJOR 298 (2022) 1, pp. 89-98
Persistent link: https://www.econbiz.de/10013206812