Narrow search
Showing 1 - 10 of 27
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 machine learning-based approximation of strong branching
Marcos Alvarez, Alejandro; Louveaux, Quentin; Wehenkel, … - In: INFORMS journal on computing : JOC 29 (2017) 1, pp. 185-195
Persistent link: https://www.econbiz.de/10011648592
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 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
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
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