Narrow search
Showing 1 - 10 of 455
Cover Image
Constrained min-cut replication for K-way hypergraph partitioning
Yazici, Volkan; Aykanat, Cevdet - In: INFORMS journal on computing : JOC 26 (2014) 2, pp. 303-320
Persistent link: https://www.econbiz.de/10010362440
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 interval min-max regret knapsack problem
Furini, Fabio; Iori, Manuel; Martello, Silvano; … - In: INFORMS journal on computing : JOC 27 (2015) 2, pp. 392-405
Persistent link: https://www.econbiz.de/10011291290
Cover Image
A wide branching strategy for the graph coloring problem
Morrison, David Robert; Sauppe, Jason J.; Sewell, Edward C. - In: INFORMS journal on computing : JOC 26 (2014) 4, pp. 704-717
Persistent link: https://www.econbiz.de/10010477273
Cover Image
Progressive selection method for the coupled lot-sizing and cutting-stock problem
Wu, Tao; Akartunalı, Kerem; Jans, Raf; Liang, Zhe - In: INFORMS journal on computing : JOC 29 (2017) 3, pp. 523-543
Persistent link: https://www.econbiz.de/10011743471
Cover Image
Approximation of the quadratic knapsack problem
Pferschy, Ulrich; Schauer, Joachim - In: INFORMS journal on computing : JOC 28 (2016) 2, pp. 308-318
Persistent link: https://www.econbiz.de/10011489344
Cover Image
Integer programming formulations for minimum spanning tree interdiction
Wei, Ningji; Walteros, Jose L.; Mahdavi Pajouh, Foad - In: INFORMS journal on computing : JOC 33 (2021) 4, pp. 1461-1480
Persistent link: https://www.econbiz.de/10012796937
Cover Image
Dynamic programming driven memetic search for the Steiner tree problem with revenues, budget, and hop constraints
Fu, Zhang-Hua; Hao, Jin-Kao - In: INFORMS journal on computing : JOC 27 (2015) 2, pp. 221-237
Persistent link: https://www.econbiz.de/10011291334
Cover Image
A tree search algorithm for solving the container loading problem
Fanslau, Tobias; Bortfeldt, Andreas - In: INFORMS journal on computing : JOC 22 (2010) 2, pp. 222-235
Persistent link: https://www.econbiz.de/10003979973
Cover Image
Randomized decomposition solver with the quadratic assignment problem as a case study
Mihić, Krešimir; Ryan, Kevin; Wood, Alan - In: INFORMS journal on computing : JOC 30 (2018) 2, pp. 295-308
Persistent link: https://www.econbiz.de/10011878274