Andrew J. Miller

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