Narrow search
Showing 1 - 10 of 20
Cover Image
A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
Vielma, Juan Pablo; Ahmed, Shabbir; Nemhauser, George L. - In: INFORMS journal on computing : JOC 20 (2008) 3, pp. 438-450
Persistent link: https://www.econbiz.de/10008076021
Cover Image
Cluster of Expository Articles - Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
Johnson, Ellis L.; Nemhauser, George L.; Savelsbergh, … - In: INFORMS journal on computing : JOC 12 (2000) 1, pp. 2-23
Persistent link: https://www.econbiz.de/10007119147
Cover Image
Contributed Research Articles - Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
Gu, Zonghao; Nemhauser, George L.; Savelsbergh, Martin W.P. - In: INFORMS journal on computing : JOC 11 (1999) 1, pp. 117
Persistent link: https://www.econbiz.de/10007123230
Cover Image
Contributed Research Articles - Lifted Cover Inequalities for 0-1 Integer Programs: Computation
Gu, Zonghao; Nemhauser, George L.; Savelsbergh, Martin W.P. - In: INFORMS journal on computing : JOC 10 (1998) 4, pp. 427-437
Persistent link: https://www.econbiz.de/10007124215
Cover Image
The Fixed-Charge Shortest-Path Problem
Engineer, Faramroze G.; Nemhauser, George L.; … - In: INFORMS journal on computing : JOC 24 (2012) 4, pp. 578-597
Persistent link: https://www.econbiz.de/10010040872
Cover Image
Lifted Tableaux Inequalities for 0-1 Mixed-Integer Programs: A Computational Study
Narisetty, Amar K.; Richard, Jean-Philippe P.; … - In: INFORMS journal on computing : JOC 23 (2011) 3, pp. 416-425
Persistent link: https://www.econbiz.de/10009188091
Cover Image
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
Hewitt, Mike; Nemhauser, George L.; Savelsbergh, Martin … - In: INFORMS journal on computing : JOC 22 (2010) 2, pp. 314-326
Persistent link: https://www.econbiz.de/10008410687
Cover Image
Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem
Engineer, Faramroze G.; Nemhauser, George L.; … - In: INFORMS journal on computing : JOC 23 (2011) 1, pp. 105-120
Persistent link: https://www.econbiz.de/10008849737
Cover Image
Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
Hewitt, Mike; Nemhauser, George L.; Savelsbergh, Martin … - In: INFORMS journal on computing : JOC 22 (2010) 2, pp. 314-325
Persistent link: https://www.econbiz.de/10003979991
Cover Image
A note on "a superior representation method for piecewise linear functions"
Vielma, Juan Pablo; Ahmed, Shabbir; Nemhauser, George L. - In: INFORMS journal on computing : JOC 22 (2010) 3, pp. 493-497
Persistent link: https://www.econbiz.de/10008651597