default search action
David L. Woodruff
Person information
- affiliation: University of California, Davis, Graduate School of Management, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j38]Xiaotie Chen, David L. Woodruff
:
Distributions and bootstrap for data-based stochastic programming. Comput. Manag. Sci. 21(1): 33 (2024) - [j37]Yingjie Fan
Catastrophe insurance and flexible planning for supply chain disruption management: a stochastic simulation case study. Int. J. Prod. Res. 62(4): 1108-1125 (2024) - 2023
- [j36]Xiaotie Chen, David L. Woodruff
Software for Data-Based Stochastic Programming Using Bootstrap Estimation. INFORMS J. Comput. 35(6): 1218-1224 (2023) - [j35]Bernard Knueven, David T. Mildebrath, Christopher Muir, John D. Siirola, Jean-Paul Watson
A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty. Math. Program. Comput. 15(4): 591-619 (2023) - 2022
- [j34]Mark L. Spearman, David L. Woodruff, Wallace J. Hopp:
CONWIP Redux: reflections on 30 years of development and implementation. Int. J. Prod. Res. 60(1): 381-387 (2022)
2010 – 2019
- 2018
- [j33]Jorge Oyola
The stochastic vehicle routing problem, a literature review, part I: models. EURO J. Transp. Logist. 7(3): 193-221 (2018) - [e1]Shaojie Tang, Ding-Zhu Du, David L. Woodruff, Sergiy Butenko:
Algorithmic Aspects in Information and Management - 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3-4, 2018, Proceedings. Lecture Notes in Computer Science 11343, Springer 2018, ISBN 978-3-030-04617-0 [contents] - 2017
- [j32]Geir Hasle, Lars Magnus Hvattum, David L. Woodruff:
Preface: logistics, optimization and transportation - in memory of the late Arne Løkketangen. Ann. Oper. Res. 253(2): 709-711 (2017) - [j31]Jorge Oyola
The stochastic vehicle routing problem, a literature review, Part II: solution methods. EURO J. Transp. Logist. 6(4): 349-388 (2017) - [j30]Jason Barnett, Jean-Paul Watson, David L. Woodruff
BBPH: Using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs. Oper. Res. Lett. 45(1): 34-39 (2017) - [c7]Yingjie Fan
Stochastic Programming for Global Supply Chain Planning Under Uncertainty: An Outline. ICCL 2017: 437-451 - 2016
- [j29]Dinakar Gade, Gabriel Hackebeil, Sarah M. Ryan
Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs. Math. Program. 157(1): 47-67 (2016) - 2015
- [j28]Fernando Badilla Veliz, Jean-Paul Watson, Andrés Weintraub
Stochastic optimization models in forest planning: a progressive hedging solution approach. Ann. Oper. Res. 232(1): 259-274 (2015) - [j27]Ignacio Rios
Multi-period forecasting and scenario generation with limited data. Comput. Manag. Sci. 12(2): 267-295 (2015) - [j26]Ge Guo, Gabriel Hackebeil, Sarah M. Ryan
Integration of progressive hedging and dual decomposition in stochastic integer programs. Oper. Res. Lett. 43(3): 311-316 (2015) - 2014
- [j25]David L. Woodruff:
Arne Løkketangen: February 2, 1954-June 10, 2013. J. Heuristics 20(4): 359-360 (2014) - [j24]Uladzimir Rubasheuski, Johan Oppen, David L. Woodruff:
Multi-stage scenario generation by the combined moment matching and scenario reduction method. Oper. Res. Lett. 42(5): 374-377 (2014) - 2013
- [j23]David L. Woodruff:
Message from the Editor. INFORMS J. Comput. 25(1): 1 (2013) - [j22]David L. Woodruff:
From the Editor. INFORMS J. Comput. 25(3): 395 (2013) - 2012
- [j21]Jean-Paul Watson, David L. Woodruff, William E. Hart:
PySP: modeling and solving stochastic programs in Python. Math. Program. Comput. 4(2): 109-149 (2012) - 2011
- [j20]Jean-Paul Watson, David L. Woodruff:
Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems. Comput. Manag. Sci. 8(4): 355-370 (2011) - [j19]David L. Woodruff, Ulrike Ritzinger, Johan Oppen:
Research note: the point of diminishing returns in heuristic search. Int. J. Metaheuristics 1(3): 222-231 (2011) - [j18]William E. Hart, Jean-Paul Watson, David L. Woodruff:
Pyomo: modeling and solving mathematical programs in Python. Math. Program. Comput. 3(3): 219-260 (2011) - [c6]Julia Pahl
Discrete Lot-Sizing and Scheduling with Sequence-Dependent Setup Times and Costs Including Deterioration and Perishability Constraints. HICSS 2011: 1-10 - 2010
- [j17]Jean-Paul Watson, Roger J.-B. Wets, David L. Woodruff:
Scalable Heuristics for a Class of Chance-Constrained Stochastic Programs. INFORMS J. Comput. 22(4): 543-554 (2010)
2000 – 2009
- 2009
- [j16]Johan Oppen, David L. Woodruff:
Parametric models of local search progression. Int. Trans. Oper. Res. 16(5): 627-640 (2009) - [j15]Emilie Danna, David L. Woodruff:
How to select a small set of diverse solutions to mixed integer programming problems. Oper. Res. Lett. 37(4): 255-260 (2009) - 2008
- [j14]Peter Greistorfer, Arne Løkketangen, Stefan Voß
Experiments concerning sequential versus simultaneous maximization of objective function and distance. J. Heuristics 14(6): 613-625 (2008) - 2007
- [j13]Julia Pahl
Production planning with load dependent lead times: an update of research. Ann. Oper. Res. 153(1): 297-345 (2007) - [c5]Geun-Cheol Lee
Heuristic Search for 2D NMR Alignment to Support Metabolite Identification. ESCAPE 2007: 447-458 - [c4]Jaya Sreevalsan-Nair
Human-Guided Enhancement of a Stochastic Local Search: Visualization and Adjustment of 3D Pheromone. SLS 2007: 182-186 - 2006
- [b1]Stefan Voß
Introduction to computational optimization models for production planning in a supply chain (2. ed.). Springer 2006, ISBN 978-3-540-29878-6, pp. I-XII, 1-257 - [c3]David L. Woodruff, Stefan Voß
Planning for a Big Bang in a Supply Chain: Fast Hedging for Production Indicators. HICSS 2006 - 2005
- [j12]Julia Pahl
Production planning with load dependent lead times. 4OR 3(4): 257-302 (2005) - [j11]Arne Løkketangen, David L. Woodruff:
A distance function to support optimized selection decisions. Decis. Support Syst. 39(3): 345-354 (2005) - [j10]Harald Held, David L. Woodruff:
Heuristics for Multi-Stage Interdiction of Stochastic Networks. J. Heuristics 11(5-6): 483-500 (2005) - 2004
- [j9]David L. Woodruff, Torsten Reiners
Experiments with, and on, algorithms for maximum likelihood clustering. Comput. Stat. Data Anal. 47(2): 237-253 (2004) - [c2]David L. Woodruff, Stefan Voß:
A Model for Multi-Stage Production Planning with Load Dependent Lead Times. HICSS 2004 - 2003
- [p1]Andreas Fink, Stefan Voß, David L. Woodruff:
Metaheuristic Class Libraries. Handbook of Metaheuristics 2003: 515-535 - 2002
- [c1]David M. Rocke, David L. Woodruff:
Computational Connections between Robust Multivariate Analysis and Clustering. COMPSTAT 2002: 255-260 - 2001
- [j8]Kjetil K. Haugen
Progressive hedging as a meta-heuristic applied to stochastic lot-sizing. Eur. J. Oper. Res. 132(1): 116-122 (2001)
1990 – 1999
- 1999
- [j7]Michael G. Van Buer, David L. Woodruff, Rick T. Olson:
Solving the medium newspaper production/distribution problem. Eur. J. Oper. Res. 115(2): 237-253 (1999) - 1998
- [j6]Tore W. Jonsbråten, Roger J.-B. Wets, David L. Woodruff:
A class of stochastic programs withdecision dependent random elements. Ann. Oper. Res. 82: 83-106 (1998) - [j5]David L. Woodruff:
Proposals for chunking and tabu search. Eur. J. Oper. Res. 106(2-3): 585-598 (1998) - 1996
- [j4]Arne Løkketangen, David L. Woodruff:
Progressive hedging and tabu search applied to mixed integer (0, 1) multistage stochastic programming. J. Heuristics 2(2): 111-128 (1996) - 1995
- [j3]David L. Woodruff:
Ghost Image Processing for Minimum Covariance Determinants. INFORMS J. Comput. 7(4): 468-473 (1995) - 1994
- [j2]David L. Woodruff:
Simulated annealing and tabu search: Lessons from a line search. Comput. Oper. Res. 21(8): 823-839 (1994) - 1993
- [j1]David L. Woodruff, Eitan Zemel:
Hashing vectors for tabu search. Ann. Oper. Res. 41(2): 123-137 (1993)
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-11-07 20:24 CET 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: