840 search results - page 50 / 168 » Inapproximability of Combinatorial Optimization Problems |
111
click to vote
ATMOS
2008
15 years 1 months ago
2008
In the last 15 years periodic timetable problems have found much interest in the combinatorial optimization community. We will focus on the optimisation task to minimise a weighted...
110
click to vote
JUCS
2008
15 years 9 days ago
2008
: Evolutionary algorithms are effective search tools for tackling difficult optimization problems. In this paper an algorithm based on living processes where cooperation is the mai...
133
Voted
ANTSW
2010
Springer
14 years 10 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
100
click to vote
AAAI
2008
15 years 2 months ago
2008
We present the design of a banner advertising auction which is considerably more expressive than current designs. We describe a general model of expressive ad contracts/bidding an...
ANTSW
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...