6455 search results - page 71 / 1291 » Research problems |
149
click to vote
IPCO
2008
15 years 3 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
112
click to vote
NETWORKS
2008
15 years 2 months ago
2008
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
123
click to vote
JCO
2007
15 years 2 months ago
2007
In adversarial environments, disabling the communication capabilities of the enemy is a high priority. We introduce the problem of determining the optimal number and locations for ...
135
Voted
TRANSCI
2010
14 years 9 months ago
2010
We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncert...
95
Voted
AIED
2009
Springer
15 years 9 months ago
2009
Springer
The Extensible Problem-Specific Tutor (xPST) system was created to facilitate the creation of intelligent tutoring systems (ITSs) on existing software and web-based interfaces. Thi...