14649 search results - page 330 / 2930 » Principles of problem solving |
190
click to vote
CEC
2009
IEEE
16 years 1 months ago
2009
IEEE
— Many real-world problems are dynamic, requiring an optimization algorithm which is able to continuously track a changing optimum over time. In this paper, we present a stigmerg...
188
click to vote
CPAIOR
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack pr...
198
click to vote
AAIM
2006
Springer
16 years 20 days ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
187
click to vote
OR
2005
Springer
16 years 5 days ago
2005
Springer
In the open route version of the well-known vehicle routing problem, vehicles are not required to return to the depot; or if they are required, then they return by traveling the sa...
195
click to vote
ICTAI
2003
IEEE
2003
IEEE
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
15 years 12 months ago
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...