6976 search results - page 73 / 1396 » The Oil Searching Problem |
205
click to vote
EVOW
2009
Springer
15 years 12 months ago
2009
Springer
This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the tr...
144
click to vote
MP
2008
15 years 5 months ago
2008
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
127
click to vote
DIAGRAMS
2008
Springer
15 years 6 months ago
2008
Springer
State-space search methods in problem solving have often been illustrated using tree diagrams. We explore a set of issues related to coordination in collaborative problem solving a...
176
Voted
EOR
2010
15 years 2 months ago
2010
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
145
Voted
HEURISTICS
2002
15 years 4 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...