9842 search results - page 232 / 1969 » The Complexity of the Matching-Cut Problem |
EVOW
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Evolutionary algorithms are powerful tools in search and optimization tasks with several applications in complex engineering problems. However, setting all associated par...
STACS
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
ICTAI
2005
IEEE
14 years 4 months ago
2005
IEEE
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
COMPLEXITY
2004
13 years 10 months ago
2004
nical Abstract Optimization is to find the "best" solution to a problem where the quality of a solution can be measured by a given criterion. Estimation of Distribution A...
HM
2007
Springer
14 years 5 months ago
2007
Springer
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...