Keyword: programming: dynamic

Found 2342 papers in total
Determining optimal road class and road deactivation strategies using dynamic programming
Determining optimal road class and road deactivation strategies using dynamic programming
2006,
Forest managers are faced with complicated road construction and deactivation...
Three mathematical models for bucking-to-order
Three mathematical models for bucking-to-order
2006,
The aim of this paper is to investigate different mathematical approaches to...
Dynamic programming–neural network real-time traffic adaptive signal control algorithm
Dynamic programming–neural network real-time traffic adaptive signal control algorithm
2006,
In this paper, an ‘intelligent’ isolated intersection control system was...
Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems
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...
An effective genetic algorithm approach to multiobjective routing problems
An effective genetic algorithm approach to multiobjective routing problems
2005,
Dynamic programming (DP) is a mathematical procedure designed primarily to improve the...
Upgrading arcs to minimize the maximum travel time in a network
Upgrading arcs to minimize the maximum travel time in a network
2006,
In transportation and telecommunication systems, the performance of the underlying...
An effective genetic algorithm approach to multiobjective resource allocation problems
An effective genetic algorithm approach to multiobjective resource allocation problems
2005,
Dynamic programming (DP) is a mathematical procedure designed primarily to improve the...
Bucket elimination for multiobjective optimization problems
Bucket elimination for multiobjective optimization problems
2006,
Multiobjective optimization deals with problems involving multiple measures of...
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
2006,
We consider the standard dynamic program to solve the TSP. We then obtain...
Tour merging via branch-decomposition
Tour merging via branch-decomposition
2003,
Robertson and Seymour introduced branch-width as a new connectivity invariant of...
Optimal ordering policies for periodic-review systems with replenishment cycles
Optimal ordering policies for periodic-review systems with replenishment cycles
2006,
In this paper, we consider inventory models for periodic-review systems with...
A dynamic programming approach to price installment options
A dynamic programming approach to price installment options
2006,
Installment options are Bermudan-style options where the holder periodically decides...
A dynamic production and transportation model with heterogeneous vehicle types
A dynamic production and transportation model with heterogeneous vehicle types
2003,
This paper considers the single-product production and transportation problem with...
Approximating infinite horizon stochastic optimal control in discrete time with constraints
Approximating infinite horizon stochastic optimal control in discrete time with constraints
2006,
Traditional approaches to solving stochastic optimal control problems involve dynamic...
Dynamic programming approach to discrete time dynamic feedback Stackelberg games with independent and dependent followers
Dynamic programming approach to discrete time dynamic feedback Stackelberg games with independent and dependent followers
2006,
Stackelberg games play an extremely important role in such fields as economics,...
Dynamic load balancing in parallel queuing systems: Stability and optimal control
Dynamic load balancing in parallel queuing systems: Stability and optimal control
2006,
We consider a system of parallel queues with dedicated arrival streams. At each...
A hybrid meta-heuristic for the batching problem in just-in-time flow shops
A hybrid meta-heuristic for the batching problem in just-in-time flow shops
2006,
This paper is concerned with a batching problem encountered in the context of...
Single machine parallel batch scheduling problem with release dates and three hierarchical criteria to minimize makespan, machine occupation time and stocking cost
Single machine parallel batch scheduling problem with release dates and three hierarchical criteria to minimize makespan, machine occupation time and stocking cost
2006,
In this paper we consider an unbounded model of the single machine parallel batch...
Near-optimal solutions of large-scale single-machine scheduling problems
Near-optimal solutions of large-scale single-machine scheduling problems
2005,
The single-machine scheduling problem (SMSP) with release dates concerns the optimal...
An optimal investigation in two stage search with recognition errors
An optimal investigation in two stage search with recognition errors
2006,
We consider an optimal search plan for a movable target. A searcher conducts a...
Sensitivity analysis for a make-to-order inventory–production system with limited order acceptance level
Sensitivity analysis for a make-to-order inventory–production system with limited order acceptance level
2005,
This paper considers a make-to-order inventory–production system in which...
Stochastic comparison on an inventory system with yield uncertainty
Stochastic comparison on an inventory system with yield uncertainty
2005,
In this paper we discuss the optimal problem on a discrete-time, single item, periodic...
Algorithms for solving the conditional covering problem on paths
Algorithms for solving the conditional covering problem on paths
2005,
Consider the conditional covering problem on an undirected graph, where each node...
Dynamic programming algorithms for the conditional covering problem on path and extended star graphs
Dynamic programming algorithms for the conditional covering problem on path and extended star graphs
2005,
The Conditional Covering Problem (CCP) is a facility location problem on a graph,...
Papers per page: