840 search results - page 15 / 168 » Inapproximability of Combinatorial Optimization Problems |
SAGA
2005
Springer
14 years 4 months ago
2005
Springer
Two general-purpose metaheuristic algorithms for solving multiobjective stochastic combinatorial optimization problems are introduced: SP-ACO (based on the Ant Colony Optimization ...
HICSS
2005
IEEE
14 years 4 months ago
2005
IEEE
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
GEOINFORMATICA
2002
13 years 10 months ago
2002
Genetic algorithms (GAs) are powerful combinatorial optimizers that are able to
ESA
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
INFOCOM
2010
IEEE
13 years 9 months ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...