Narrow search
Showing 1 - 10 of 37
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-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
Branch-and-bound for bi-objective integer programming
Parragh, Sophie N.; Tricoire, Fabien - In: INFORMS journal on computing : JOC 31 (2019) 4, pp. 805-822
Persistent link: https://www.econbiz.de/10012125761
Cover Image
Single-machine scheduling problems with generalized preemption
Agnetis, Alessandro; Alfieri, Arianna; Nicosia, Gaia - In: INFORMS journal on computing : JOC 21 (2009) 1, pp. 1-12
Persistent link: https://www.econbiz.de/10003896591
Cover Image
Backdoor branching
Fischetti, Matteo; Monaci, Michele - In: INFORMS journal on computing : JOC 25 (2013) 4, pp. 693-700
Persistent link: https://www.econbiz.de/10010203613
Cover Image
A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
Görtz, Simon; Klose, Andreas - In: INFORMS journal on computing : JOC 24 (2012) 4, pp. 597-610
Persistent link: https://www.econbiz.de/10010219625
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
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
Predicting the solution time of branch-and-bound algorithms for mixed-integer programs
Özaltın, Osman Y.; Hunsaker, Brady; Schaefer, Andrew J. - In: INFORMS journal on computing : JOC 23 (2011) 3, pp. 392-403
Persistent link: https://www.econbiz.de/10009296301
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