On the Landscape of Combinatorial Optimization Problems
نویسندگان
چکیده
منابع مشابه
On the Depth of Combinatorial Optimization Problems
This paper studies the notion of “depth” of a combinatorial optimization problem, which has already been touched on by several other authors (cf. Weber or Hajek). This notion can be defined as follows: Consider a discrete optimization problem min{r(.u) 1 x E x). Usually hill climbing algorithms work as follows: First, a neighbourhood structure has to be specified on X. Then, starting from an ar...
متن کاملOn Solving Combinatorial Optimization Problems
We present a new viewpoint on how some combinatorial optimization problems are solved. When applying this viewpoint to the NP -equivalent traveling salesman problem (TSP), we naturally arrive to a conjecture that is closely related to the polynomialtime insolvability of TSP, and hence to the P −NP conjecture. Our attempt to prove the conjecture has not been successful so far. However, the bypro...
متن کاملInapproximability of Combinatorial Optimization Problems
We survey results on the hardness of approximating combinatorial optimization problems.
متن کاملA Methodology to Find the Elementary Landscape Decomposition of Combinatorial Optimization Problems
A small number of combinatorial optimization problems have search spaces that correspond to elementary landscapes, where the objective function f is an eigenfunction of the Laplacian that describes the neighborhood structure of the search space. Many problems are not elementary; however, the objective function of a combinatorial optimization problem can always be expressed as a superposition of...
متن کاملThe Complexity of Combinatorial Optimization Problems on d-Dimensional Boxes
The Maximum Independent Set problem in d-box graphs, i.e., in intersection graphs of axis-parallel rectangles in Rd, is known to be NP-hard for any fixed d ≥ 2. A challenging open problem is, how close the solution can be approximated by a polynomial time algorithm. For the restricted case of d-boxes with bounded aspect ratio a PTAS exists [12]. In general case no polynomial time algorithm with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2014
ISSN: 1089-778X,1089-778X,1941-0026
DOI: 10.1109/tevc.2013.2281502