Narrow search
Showing 1 - 10 of 12
Cover Image
A core-based exact algorithm for the multidimensional multiple choice knapsack problem
Mansini, Renata; Zanotti, Roberto - In: INFORMS journal on computing : JOC 32 (2020) 4, pp. 1061-1079
Persistent link: https://www.econbiz.de/10012390185
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 game theoretic model for the optimal location of integrated air defense system missile batteries
Han, Chan Y.; Lunday, Brian J.; Robbins, Matthew J. - In: INFORMS journal on computing : JOC 28 (2016) 3, pp. 405-416
Persistent link: https://www.econbiz.de/10011538954
Cover Image
Achieving domain consistency and counting solutions for dispersion constraints
Pesant, Gilles - In: INFORMS journal on computing : JOC 27 (2015) 4, pp. 690-703
Persistent link: https://www.econbiz.de/10011422666
Cover Image
Lateness minimization in pairwise connectivity restoration problems
Averbakh, Igor; Pereira, Jordi - In: INFORMS journal on computing : JOC 30 (2018) 3, pp. 522-538
Persistent link: https://www.econbiz.de/10011948069
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
Solving variants of the job shop scheduling problem through conflict-directed search
Grimes, Diarmuid; Hebrard, Emmanuel - In: INFORMS journal on computing : JOC 27 (2015) 2, pp. 268-284
Persistent link: https://www.econbiz.de/10011291327
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
Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
Gadegaard, Sune Lauth; Nielsen, Lars Relund; Ehrgott, … - In: INFORMS journal on computing : JOC 31 (2019) 4, pp. 790-804
Persistent link: https://www.econbiz.de/10012125747
Cover Image
Two-dimensional phase unwrapping via balanced spanning forests
Herszterg, Ian; Poggi, Marcus; Vidal, Thibaut - In: INFORMS journal on computing : JOC 31 (2019) 3, pp. 527-543
Persistent link: https://www.econbiz.de/10012061804