Narrow search
Showing 1 - 10 of 49
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
Integrated production, inventory and delivery problems : complexity and algorithms
Li, Feng; Chen, Zhi-long; Tang, Lixin - In: INFORMS journal on computing : JOC 29 (2017) 2, pp. 232-250
Persistent link: https://www.econbiz.de/10011691149
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
Uncommon Dantzig-Wolfe reformulation for the temporal knapsack problem
Caprara, Alberto; Furini, Fabio; Malaguti, Enrico - In: INFORMS journal on computing : JOC 25 (2013) 3, pp. 560-571
Persistent link: https://www.econbiz.de/10009784044