Cordone, Roberto and Lulli, Guglielmo (2016) Multimode extensions of combinatorial optimization problems. Electronic Notes in Discrete Mathematics, 55. pp. 17-20. ISSN 1571-0653
Preview
PDF (MMinCO)
MMinCO.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.
Download (71kB)
MMinCO.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.
Download (71kB)
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).
Item Type:
Journal Article
Journal or Publication Title:
Electronic Notes in Discrete Mathematics
Additional Information:
This is the author’s version of a work that was accepted for publication in Electronic Notes in Discrete Mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Electronic Notes in Discrete Mathematics, 55, 2016 DOI: 10.1016/j.endm.2016.10.005
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2600/2607
Subjects:
?? combinatorial optimization;covering problemscomplexityvariable neighborhood searchdiscrete mathematics and combinatoricsapplied mathematicsdiscipline-based research ??
Departments:
ID Code:
82497
Deposited By:
Deposited On:
20 Jun 2017 09:36
Refereed?:
Yes
Published?:
Published
Last Modified:
27 Oct 2024 00:15