All Stories

  1. Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem

    Article • INFORMS Journal on Computing, May 2013, INFORMS

    George Nemhauser

  2. The Fixed-Charge Shortest-Path Problem

    Article • INFORMS Journal on Computing, November 2012, INFORMS

    George Nemhauser

  3. Lifted Tableaux Inequalities for 0–1 Mixed-Integer Programs: A Computational Study

    Article • INFORMS Journal on Computing, August 2011, INFORMS

    George Nemhauser, Jean-Philippe Richard

  4. Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem

    Article • INFORMS Journal on Computing, February 2011, INFORMS

    George Nemhauser, Martin Savelsbergh

  5. Tactical and Operational Planning of Scheduled Maintenance for Per-Seat, On-Demand Air Transportation

    Article • Transportation Science, August 2010, INFORMS

    George Nemhauser, Martin Savelsbergh

  6. Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem

    Article • INFORMS Journal on Computing, May 2010, INFORMS

    George Nemhauser, Martin Savelsbergh

  7. Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model

    Article • Transportation Science, August 2008, INFORMS

    George Nemhauser, Martin Savelsbergh

  8. Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search

    Article • Transportation Science, August 2008, INFORMS

    George Nemhauser, Martin Savelsbergh