Narrow search
Showing 1 - 10 of 438
Cover Image
A parallel branch-and-bound approach to the rectangular guillotine strip cutting Problem
Bak, Slawomir; Błażewicz, Jacek; Pawlak, Grzegorz; … - In: INFORMS journal on computing : JOC 23 (2011) 1, pp. 15-25
Persistent link: https://www.econbiz.de/10008935649
Cover Image
A branch-and-bound algorithm for the close-enough traveling salesman problem
Coutinho, Walton Pereira; Nascimento, Roberto Quirino do; … - In: INFORMS journal on computing : JOC 28 (2016) 4, pp. 752-765
Persistent link: https://www.econbiz.de/10011617601
Cover Image
A branch-and-bound approach to the traveling salesman problem with a drone
Poikonen, Stefan; Golden, Bruce; Wasil, Edward A. - In: INFORMS journal on computing : JOC 31 (2019) 2, pp. 335-346
Persistent link: https://www.econbiz.de/10012036788
Cover Image
A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem
Nagata, Yuichi; Kobayashi, Shigenobu - In: INFORMS journal on computing : JOC 25 (2013) 2, pp. 346-363
Persistent link: https://www.econbiz.de/10009753749
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
Multivariable branching : a 0-1 knapsack problem case study
Yang, Yu; Boland, Natashia; Savelsbergh, Martin W. P. - In: INFORMS journal on computing : JOC 33 (2021) 4, pp. 1354-1367
Persistent link: https://www.econbiz.de/10012796862
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
A branch-and-bound algorithm for team formation on social networks
Berktaş, Nihal; Yaman, Hande - In: INFORMS journal on computing : JOC 33 (2021) 3, pp. 1162-1176
Persistent link: https://www.econbiz.de/10012631664
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
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea; Cacchiani, Valentina; Malaguti, Enrico - In: INFORMS journal on computing : JOC 29 (2017) 3, pp. 457-473
Persistent link: https://www.econbiz.de/10011743447