Narrow search
Showing 1 - 10 of 411
Cover Image
Combining lift-and-project and reduce-and-split
Balas, Egon; Cornuéjols, Gérard; Kis, Tamás; … - In: INFORMS journal on computing : JOC 25 (2013) 3, pp. 475-487
Persistent link: https://www.econbiz.de/10009784063
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 linear-programming approximation of AC power flows
Coffrin, Carleton; Van Hentenryck, Pascal - In: INFORMS journal on computing : JOC 26 (2014) 4, pp. 718-734
Persistent link: https://www.econbiz.de/10010477269
Cover Image
A bucket indexed formulation for nonpreemptive single machine scheduling problems
Boland, Natashia; Clement, Riley; Waterer, Hamish - In: INFORMS journal on computing : JOC 28 (2016) 1, pp. 14-30
Persistent link: https://www.econbiz.de/10011453766
Cover Image
Dual inequalities for stabilized column generation revisited
Gschwind, Timo; Irnich, Stefan - In: INFORMS journal on computing : JOC 28 (2016) 1, pp. 175-194
Persistent link: https://www.econbiz.de/10011453820
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
Cover Image
Target cuts from relaxed decision diagrams
Tjandraatmadja, Christian; Hoeve, Willem-Jan van - In: INFORMS journal on computing : JOC 31 (2019) 2, pp. 285-301
Persistent link: https://www.econbiz.de/10012036780
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
In memoriam: Shabbir Ahmed (1969-2019)
Smith, J. Cole - In: INFORMS journal on computing : JOC 31 (2019) 4, pp. 633-635
Persistent link: https://www.econbiz.de/10012125718
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