Sciweavers

3663 search results - page 22 / 733
» Problems in the ontology of computer programs
Sort
View
NETWORKS
2008
13 years 8 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
MP
2010
132views more  MP 2010»
13 years 3 months ago
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the b...
Etienne de Klerk, Renata Sotirov
PATAT
2004
Springer
148views Education» more  PATAT 2004»
14 years 1 months ago
Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming
Timetabling problems have been frequently studied due to their wide range of applications. However, they are often solved manually because of the lack of appropriate computer tools...
Hadrien Cambazard, Fabien Demazeau, Narendra Jussi...
COR
2006
82views more  COR 2006»
13 years 8 months ago
Semidefinite programming based approaches to the break minimization problem
This paper considers the break minimization problem in sports timetabling. The problem is to find, under a given timetable of a round-robin tournament, a home-away assignment that...
Ryuhei Miyashiro, Tomomi Matsui
AMAI
2006
Springer
13 years 8 months ago
Symmetric approximate linear programming for factored MDPs with application to constrained problems
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
Dmitri A. Dolgov, Edmund H. Durfee