9842 search results - page 199 / 1969 » Problem complexity |
138
click to vote
EOR
2008
15 years 2 months ago
2008
In this paper we study a rich vehicle routing problem incorporating various complexities found in real-life applications. The General Vehicle Routing Problem (GVRP) is a combined ...
112
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
122
Voted
ECSQARU
2009
Springer
15 years 9 months ago
2009
Springer
Partially preordered belief bases are very convenient for an efficient representation of incomplete knowledge. They offer flexibility and avoid to compare unrelated pieces of inf...
104
click to vote
JSSPP
2005
Springer
15 years 8 months ago
2005
Springer
Using historical information to predict future runs of parallel jobs has shown to be valuable in job scheduling. Trends toward more flexible jobscheduling techniques such as adapt...
214
click to vote
POPL
2008
ACM
16 years 2 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...