|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Unrefereed|
|Title:||Editorial for the Special Issue on Combinatorial Optimization Problems|
|Citation:||Chicano F, Blum C & Ochoa G (2016) Editorial for the Special Issue on Combinatorial Optimization Problems, Evolutionary Computation, 24 (4), pp. 573-575.|
|Abstract:||First paragraph: In combinatorial optimization, the goal is to find an optimal solution, according to some objective function, from a discrete search space. These problems arise widely in industry and academia and, unfortunately, many of them are NP-hard and no polynomial time algorithm can guarantee their solution to a certified optimality unless. Therefore, in the last decades researchers have investigated the use of stochastic search algorithms to find near optimal solutions to these problems. In particular, great research efforts have been devoted to the development and application of metaheuristic algorithms to solve combinatorial optimization problems.|
|Rights:||Publisher policy allows this work to be made available in this repository. Published in Evolutionary Computation, Volume 24, Issue 4, December 2016, p.573-575 by MIT Press. The original publication is available at:|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact email@example.com providing details and we will remove the Work from public display in STORRE and investigate your claim.