Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarAndrew J. Miller
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2016
[j15]Kerem Akartunali, Ioannis Fragkos, Andrew J. Miller, Tao Wu:
Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems. INFORMS Journal on Computing 28(4): 766-780 (2016)- 2012
- [j14]Kerem Akartunali, Andrew J. Miller:
A computational analysis of lower bounds for big bucket production planning problems. Comp. Opt. and Appl. 53(3): 729-753 (2012) - [j13]Pierre Bonami, Leo Liberti, Andrew J. Miller, Annick Sartenaer:
Preface. Math. Program. 136(2): 229-231 (2012) - 2010
- [j12]Pietro Belotti, Andrew J. Miller, Mahdi Namazifar:
Valid Inequalities and Convex Hulls for Multilinear Functions. Electronic Notes in Discrete Mathematics 36: 805-812 (2010) - [j11]Brian T. Denton, Andrew J. Miller, Hari Balasubramanian, Todd R. Huschka:
Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty. Operations Research 58(4-Part-1): 802-816 (2010) - [j10]Miguel Constantino, Andrew J. Miller, Mathieu Van Vyve:
Mixing MIR inequalities with two divisible coefficients. Math. Program. 123(2): 451-483 (2010)
2000 – 2009
- 2009
- [j9]Kerem Akartunali, Andrew J. Miller:
A heuristic approach for big bucket multi-level production planning problems. European Journal of Operational Research 193(2): 396-411 (2009) - 2008
- [j8]Yongpei Guan, Andrew J. Miller:
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems. Operations Research 56(5): 1172-1183 (2008) - [c2]Mahdi Namazifar, Andrew J. Miller:
A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs. CPAIOR 2008: 343-348 - 2006
- [j7]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): 55-84 (2006) - [j6]Yongpei Guan, Shabbir Ahmed, Andrew J. Miller, George L. Nemhauser:
On formulations of the stochastic uncapacitated lot-sizing problem. Oper. Res. Lett. 34(3): 241-250 (2006) - 2003
- [j5]Andrew J. Miller, Laurence A. Wolsey:
Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems. Operations Research 51(4): 557-565 (2003) - [j4]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): 375-405 (2003) - [j3]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): 71-90 (2003) - [j2]Andrew J. Miller, Laurence A. Wolsey:
Tight formulations for some simple mixed integer programs and convex objective integer programs. Math. Program. 98(1-3): 73-88 (2003) - 2001
- [c1]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: 318-332 - 2000
- [j1]Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh:
On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra. European Journal of Operational Research 125(2): 298-315 (2000)
Coauthor Index
maintained by 
at 
at 
last updated on 2018-05-28 00:11 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint