Sciweavers

805 search results - page 10 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
AUSAI
2005
Springer
14 years 3 months ago
A Lagrangian Heuristic for Winner Determination Problem in Combinatorial Auctions
Abstract. We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by appl...
Andrew Lim, Jiqing Tang
ACID
2006
264views Algorithms» more  ACID 2006»
13 years 11 months ago
A Parameterized View on Matroid Optimization Problems
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
Dániel Marx
EVOW
2005
Springer
14 years 3 months ago
Analyzing Fitness Landscapes for the Optimal Golomb Ruler Problem
We focus on the Golomb ruler problem, a hard constrained combinatorial optimization problem. Two alternative encodings are considered, one based on the direct representation of sol...
Carlos Cotta, Antonio J. Fernández
HOLOMAS
2009
Springer
13 years 7 months ago
Collaboration of Metaheuristic Algorithms through a Multi-Agent System
Abstract. This paper introduces a framework based on multi-agent system for solving problems of combinatorial optimization. The framework allows running various metaheuristic algor...
Richard Malek
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
14 years 1 months ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius