Paper Info
Title
Multimode extensions of Combinatorial Optimization problems
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).
Year
DOI
Venue
2016
10.1016/j.endm.2016.10.005
Electronic Notes in Discrete Mathematics
Keywords
Field
DocType
Combinatorial Optimization,covering problems,complexity,Variable Neighborhood Search
Set cover problem,Discrete mathematics,Combinatorics,Heuristic,Mathematical optimization,Variable neighborhood search,Quadratic assignment problem,Combinatorial optimization,Optimization problem,Mathematics,Metaheuristic,Covering problems
Journal
Volume
ISSN
Citations 
55
1571-0653
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Roberto Cordone131028.87
Guglielmo Lulli220518.82