Article ID Journal Published Year Pages File Type
5777198 Electronic Notes in Discrete Mathematics 2016 4 Pages PDF
Abstract
We review some complexity results and present a viable heuristic approach based on the Variable Neighborhood Search (VNS) framework for multimode extension of combinatorial optimization problems, such as the the Set Covering Problem (SCP) and the Covering Location Problem (CLP).
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Multimode extensions of Combinatorial Optimization problems
Authors
, ,