Narrow search
Showing 1 - 5 of 5
Cover Image
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements
Álvarez-Miranda, Eduardo; Goycoolea, Marcos; Ljubić, Ivana - In: European journal of operational research : EJOR 289 (2021) 3, pp. 1013-1029
Persistent link: https://www.econbiz.de/10012433323
Cover Image
A new algorithm for the 0-1 Knapsack problem
Martello, Silvano - In: Management science : journal of the Institute for … 34 (1988) 5, pp. 633-644
Persistent link: https://www.econbiz.de/10001060481
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
A dual ascent-based branch-and-bound framework for the prize-collecting steiner tree and related problems
Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; … - In: INFORMS journal on computing : JOC 30 (2018) 2, pp. 402-420
Persistent link: https://www.econbiz.de/10011878363
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