Sciweavers

14649 search results - page 362 / 2930
» Principles of problem solving
Sort
View
UAI
1998
15 years 8 months ago
Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
Ronald Parr
AUTOMATICA
2008
90views more  AUTOMATICA 2008»
15 years 6 months ago
On the infinite time solution to state-constrained stochastic optimal control problems
: For an infinite-horizon optimal control problem, the cost does not, in general, converge. The classical work-around to this problem is to introduce a discount or "forgetting...
Per Rutquist, Claes Breitholtz, Torsten Wik
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 6 months ago
Algorithmic Solutions for Several Offline Constrained Resource Processing and Data Transfer Multicriteria Optimization Problems
In this paper we present novel algorithmic solutions for several resource processing and data transfer multicriteria optimization problems. The results of most of the presented tec...
Mugurel Ionut Andreica, Nicolae Tapus
ENDM
2006
77views more  ENDM 2006»
15 years 6 months ago
A Two-stage Model for a Day-ahead Paratransit Planning Problem
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
Maria L. A. G. Cremers, Willem K. Klein Haneveld, ...
EOR
2006
120views more  EOR 2006»
15 years 6 months ago
Approximate and exact algorithms for the fixed-charge knapsack problem
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
Umit Akinc