840 search results - page 22 / 168 » Inapproximability of Combinatorial Optimization Problems |
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
We propose a protocol for a local search and a genetic algorithm for the distributed traveling salesman problem (TSP). In the distributed TSP, information regarding the cost funct...
DAGSTUHL
2007
14 years 11 days ago
2007
Approximations can aim at having close to optimal value or, alternatively, they can aim at structurally resembling an optimal solution. Whereas value-approximation has been extensi...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
ICML
2007
IEEE
14 years 11 months ago
2007
IEEE
We study the problem of learning kernel machines transductively for structured output variables. Transductive learning can be reduced to combinatorial optimization problems over a...
4OR
2010
13 years 11 months ago
2010
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...