Andrew J. Miller

According to our database, Andrew J. Miller authored at least 17 papers between 2000 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems.

Kerem Akartunali, Ioannis Fragkos, Andrew J. Miller, Tao Wu

INFORMS J. Comput., 2016

2012

Preface.

Pierre Bonami, Leo Liberti, Andrew J. Miller, Annick Sartenaer

Math. Program., 2012

A computational analysis of lower bounds for big bucket production planning problems.

Kerem Akartunali, Andrew J. Miller

Comput. Optim. Appl., 2012

2010

Mixing MIR inequalities with two divisible coefficients.

Miguel Constantino, Andrew J. Miller, Mathieu Van Vyve

Math. Program., 2010

Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty.

Brian T. Denton, Andrew J. Miller, Hari Balasubramanian, Todd R. Huschka

Oper. Res., 2010

Valid Inequalities and Convex Hulls for Multilinear Functions.

Pietro Belotti, Andrew J. Miller, Mahdi Namazifar

Electron. Notes Discret. Math., 2010

2009

A heuristic approach for big bucket multi-level production planning problems.

Kerem Akartunali, Andrew J. Miller

Eur. J. Oper. Res., 2009

2008

Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems.

Yongpei Guan, Andrew J. Miller

Oper. Res., 2008

A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs.

Mahdi Namazifar, Andrew J. Miller

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

2006

On formulations of the stochastic uncapacitated lot-sizing problem.

Yongpei Guan, Shabbir Ahmed, Andrew J. Miller, George L. Nemhauser

Oper. Res. Lett., 2006

A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem.

Yongpei Guan, Shabbir Ahmed, George L. Nemhauser, Andrew J. Miller

Math. Program., 2006

2003

Tight formulations for some simple mixed integer programs and convex objective integer programs.

Andrew J. Miller, Laurence A. Wolsey

Math. Program., 2003

On the polyhedral structure of a multi-item production planning model with setup times.

Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh

Math. Program., 2003

A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case.

Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh

Math. Program., 2003

Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems.

Andrew J. Miller, Laurence A. Wolsey

Oper. Res., 2003

2001

Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times.

Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

2000

On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra.

Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh

Eur. J. Oper. Res., 2000