Sciweavers

4432 search results - page 148 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
15 years 7 months ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...
EOR
2006
103views more  EOR 2006»
15 years 3 months ago
Exact solutions to a class of stochastic generalized assignment problems
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
Maria Albareda-Sambola, Maarten H. van der Vlerk, ...
NETWORKS
2007
15 years 2 months ago
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Stefan Ropke, Jean-François Cordeau, Gilber...
PROCEDIA
2011
14 years 6 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
166
Voted
AAAI
2011
14 years 3 months ago
Linear Dynamic Programs for Resource Management
Sustainable resource management in many domains presents large continuous stochastic optimization problems, which can often be modeled as Markov decision processes (MDPs). To solv...
Marek Petrik, Shlomo Zilberstein