Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Warren B. Powell
Information about the author Warren B. Powell will soon be added to the site.
Found
43 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Monotonicity in multidimensional Markov decision processes for the batch dispatch problem
2007
Structural properties of stochastic dynamic programs are essential to understanding...
Sensitivity analysis of a dynamic fleet management model using approximate dynamic programming
2007
We present tractable algorithms to assess the sensitivity of a stochastic dynamic...
A distributed decision-making structure for dynamic resource allocation using nonlinear functional approximations
2005
This paper proposes a distributed solution approach to a certain class of dynamic...
A metastrategy for large-scale resource management based on informational decomposition
2006
This paper addresses the solution of large, complex resource allocation problems,...
The single-node dynamic service scheduling and dispatching problem
2006
In this paper, we focus on a particular version of the dynamic service network design...
Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems
2006
In this paper, we consider a stochastic and time-dependent version of the min-cost...
The dynamic assignment problem
2004
There has been considerable recent interest in the dynamic vehicle routing problem,...
Some fixed-point results for the dynamic assignment problem
2003
In previous work the authors consider the dynamic assignment problem, which involves...
Exact algorithms for scheduling multiple families of jobs on parallel machines
2003
In many practical manufacturing environments, jobs to be processed can be divided into...
An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem
2003
We address the problem of dispatching a vehicle with different product classes. There...
An algorithm for approximating piecewise linear concave functions from sample gradients
2003
An effective algorithm for solving stochastic resource allocation problems is to build...
A flexible Java representation for uncertainty in online operations-research models
2001
Online OR models have been the subject of increased attention in recent years with the...
An adaptive, distribution-free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution
2001
We consider the problem of optimizing inventories for problems where the demand...
Implementing real-time optimization models: A case application from the motor carrier industry
2002
Online models for real-time operations planning face a host of implementation issues...
Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem
2002
The purpose of this paper is to illustrate the importance of using structural results...
A representational paradigm for dynamic resource transformation problems
2001
This paper offers a new vocabulary for representing complex problems in a stochastic,...
A flexible Java representation for uncertainty in online operations-research models
2001
Online OR models have been the subject of increased attention in recent years with the...
A note on Bertsekas' small-label-first strategy
1997
An example is presented to show that the worst-case complexity of Bertsekas'...
Shape – a stochastic hybrid approximation procedure for two-stage stochastic programs
2000
We consider the problem of approximating the expected recourse function for two-stage...
Adaptive estimation of daily demands with complex calendar effects for freight transportation
2000
We address the problem of forecasting spatial activities on a daily basis that are...
Real-time optimization of containers and flatcars for intermodal operations
1998
We propose a dynamic model for optimizing the flows of flatcars that considers...
Dynamic control of logistics queueing networks for large-scale fleet management
1998
Dynamic fleet management problems are normally formulated as networks over dynamic...
Adaptive labeling algorithms for the dynamic assignment problem
2000
We consider the problem of dynamically routing a driver to cover a sequence of tasks...
On the value of optimal myopic solutions for dynamic routing and scheduling problems in the presence of user noncompliance
2000
The most common approach for modeling and solving routing and scheduling problems in a...
1
2
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers