Narrow search
Showing 1 - 10 of 17
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 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
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
An improved branch-cut-and-price algorithm for parallel machine scheduling problems
Oliveira, Daniel Ribeiro de; Pessoa, Artur - In: INFORMS journal on computing : JOC 32 (2020) 1, pp. 90-100
Persistent link: https://www.econbiz.de/10012182988
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 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 branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
Kowalczyk, Daniel; Leus, Roel - In: INFORMS journal on computing : JOC 30 (2018) 4, pp. 768-782
Persistent link: https://www.econbiz.de/10011966567
Cover Image
Heuristic and exact algorithms for the identical parallel machine scheduling problem
Dell'Amico, Mauro; Iori, Manuel; Martello, Silvano; … - In: INFORMS journal on computing : JOC 20 (2008) 3, pp. 333-344
Persistent link: https://www.econbiz.de/10003770140
Cover Image
An improved branch-and-bound method for maximum monomial agreement
Eckstein, Jonathan; Goldberg, Noam - In: INFORMS journal on computing : JOC 24 (2012) 2, pp. 328-341
Persistent link: https://www.econbiz.de/10009551747
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