840 search results - page 5 / 168 » Inapproximability of Combinatorial Optimization Problems |
SODA
2010
ACM
15 years 6 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
WEA
2004
Springer
15 years 2 months ago
2004
Springer
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to others (e.g. [1]) in that it is modular enough that important components can be i...
102
Voted
CEC
2011
IEEE
13 years 9 months ago
2011
IEEE
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...
STOC
2002
ACM
15 years 9 months ago
2002
ACM
