Narrow search
Showing 1 - 10 of 449
Cover Image
A branch-and-price framework for decomposing graphs into relaxed cliques
Gschwind, Timo; Irnich, Stefan; Furini, Fabio - In: INFORMS journal on computing : JOC 33 (2021) 3, pp. 1070-1090
Persistent link: https://www.econbiz.de/10012631648
Cover Image
Interdiction games and monotonicity, with application to knapsack problems
Fischetti, Matteo; Ljubić, Ivana; Monaci, Michele; … - In: INFORMS journal on computing : JOC 31 (2019) 2, pp. 390-410
Persistent link: https://www.econbiz.de/10012036791
Cover Image
Scenario grouping and decomposition algorithms for chance-constrained programs
Deng, Yan; Jia, Huiwen; Ahmed, Shabbir; Lee, Jon; Shen, … - In: INFORMS journal on computing : JOC 33 (2021) 2, pp. 757-773
Persistent link: https://www.econbiz.de/10012546216
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
Cover Image
Least-cost influence maximization on social networks
Günneç, Dilek; Raghavan, S.; Zhang, Rui - In: INFORMS journal on computing : JOC 32 (2020) 2, pp. 289-302
Persistent link: https://www.econbiz.de/10012242758
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
Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
Gendron, Bernard; Lucena, Abílio; Cunha, Alexandre … - In: INFORMS journal on computing : JOC 26 (2014) 4, pp. 645-657
Persistent link: https://www.econbiz.de/10010477294
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
New heuristic approaches for the bounded-diameter minimum spanning tree problem
Steitz, Wolfgang - In: INFORMS journal on computing : JOC 27 (2015) 1, pp. 151-163
Persistent link: https://www.econbiz.de/10010505037
Cover Image
New valid inequalities for the optimal communication spanning tree problem
Agarwal, Yogesh Kumar; Venkateshan, Prahalad - In: INFORMS journal on computing : JOC 31 (2019) 2, pp. 268-284
Persistent link: https://www.econbiz.de/10012036779