default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew J. Miller
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 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 J. Comput. 28(4): 766-780 (2016)- 2012
- [j14]Kerem Akartunali, Andrew J. Miller:
A computational analysis of lower bounds for big bucket production planning problems. Comput. Optim. 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. Electron. Notes Discret. Math. 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. Oper. Res. 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. Eur. J. Oper. Res. 193(2): 396-411 (2009) - 2008
- [j8]Yongpei Guan, Andrew J. Miller:
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems. Oper. Res. 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. Oper. Res. 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. Eur. J. Oper. Res. 125(2): 298-315 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
