Andrew J. Miller

Publication Activity (10 Years)

Years Active: 2000-2016
Publications (10 Years): 1

Top Topics

Mixed Integer Programming

Planning Problems

Top Venues

Comput. Optim. Appl.

INFORMS J. Comput.

Publications

Kerem Akartunali, Ioannis Fragkos, Andrew J. Miller, Tao Wu
Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems. INFORMS J. Comput. 28 (4) (2016)
Kerem Akartunali, Andrew J. Miller
A computational analysis of lower bounds for big bucket production planning problems. Comput. Optim. Appl. 53 (3) (2012)
Pierre Bonami, Leo Liberti, Andrew J. Miller, Annick Sartenaer
Preface. Math. Program. 136 (2) (2012)
Miguel Constantino, Andrew J. Miller, Mathieu Van Vyve
Mixing MIR inequalities with two divisible coefficients. Math. Program. 123 (2) (2010)
Brian T. Denton, Andrew J. Miller, Hari Balasubramanian, Todd R. Huschka
Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty. Oper. Res. 58 (4-Part-1) (2010)
Pietro Belotti, Andrew J. Miller, Mahdi Namazifar
Valid Inequalities and Convex Hulls for Multilinear Functions. Electron. Notes Discret. Math. 36 (2010)
Kerem Akartunali, Andrew J. Miller
A heuristic approach for big bucket multi-level production planning problems. Eur. J. Oper. Res. 193 (2) (2009)
Yongpei Guan, Andrew J. Miller
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems. Oper. Res. 56 (5) (2008)
Mahdi Namazifar, Andrew J. Miller
A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs. CPAIOR (2008)
Yongpei Guan, Shabbir Ahmed, Andrew J. Miller, George L. Nemhauser
On formulations of the stochastic uncapacitated lot-sizing problem. Oper. Res. Lett. 34 (3) (2006)
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser, Andrew J. Miller
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem. Math. Program. 105 (1) (2006)
Andrew J. Miller, Laurence A. Wolsey
Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems. Oper. Res. 51 (4) (2003)
Andrew J. Miller, Laurence A. Wolsey
Tight formulations for some simple mixed integer programs and convex objective integer programs. Math. Program. 98 (1-3) (2003)
Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh
On the polyhedral structure of a multi-item production planning model with setup times. Math. Program. 94 (2-3) (2003)
Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh
A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case. Math. Program. 95 (1) (2003)
Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh
Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times. IPCO (2001)
Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh
On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra. Eur. J. Oper. Res. 125 (2) (2000)