1272 search results - page 76 / 255 » The Set Cover with Pairs Problem |
95
Voted
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
COR
2008
15 years 27 days ago
2008
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
107
Voted
HM
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...
101
click to vote
CIA
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. Evaluations of distances or similarity measurements are very important in cooperative problem solving with multiple agents. Distance between problems is used by agents to...
119
Voted
STOC
1992
ACM
15 years 4 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...