14548 search results - page 94 / 2910 » The Optimal Path-Matching Problem |
SIAMJO
2008
13 years 10 months ago
2008
We consider random approximations to deterministic optimization problems. The objective function and the constraint set can be approximated simultaneously. Relying on concentratio...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
ESA
2009
Springer
14 years 4 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
FLAIRS
2006
13 years 11 months ago
2006
In this paper we test whether a correlation exists between the optimal mutation rate and problem difficulty. We find that the range of optimal mutation rates is inversely proporti...
HEURISTICS
2006
13 years 10 months ago
2006
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...