Home > Research > Publications & Outputs > Multimode extensions of combinatorial optimizat...

Research

Associated organisational units

Electronic data

  • MMinCO

    Rights statement: 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

    Accepted author manuscript, 70.1 KB, PDF document

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License

Links

Text available via DOI:

Keywords

View graph of relations

Multimode extensions of combinatorial optimization problems

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Multimode extensions of combinatorial optimization problems. / Cordone, Roberto; Lulli, Guglielmo.
In: Electronic Notes in Discrete Mathematics, Vol. 55, 11.2016, p. 17-20.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Cordone, R & Lulli, G 2016, 'Multimode extensions of combinatorial optimization problems', Electronic Notes in Discrete Mathematics, vol. 55, pp. 17-20. https://doi.org/10.1016/j.endm.2016.10.005

APA

Cordone, R., & Lulli, G. (2016). Multimode extensions of combinatorial optimization problems. Electronic Notes in Discrete Mathematics, 55, 17-20. https://doi.org/10.1016/j.endm.2016.10.005

Vancouver

Cordone R, Lulli G. Multimode extensions of combinatorial optimization problems. Electronic Notes in Discrete Mathematics. 2016 Nov;55:17-20. Epub 2016 Nov 17. doi: 10.1016/j.endm.2016.10.005

Author

Cordone, Roberto ; Lulli, Guglielmo. / Multimode extensions of combinatorial optimization problems. In: Electronic Notes in Discrete Mathematics. 2016 ; Vol. 55. pp. 17-20.

Bibtex

@article{cd2bb72601f04690a9d5e9a07598b625,
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).",
keywords = "Combinatorial Optimization;, covering problems, complexity, Variable Neighborhood Search",
author = "Roberto Cordone and Guglielmo Lulli",
note = "This is the author{\textquoteright}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",
year = "2016",
month = nov,
doi = "10.1016/j.endm.2016.10.005",
language = "English",
volume = "55",
pages = "17--20",
journal = "Electronic Notes in Discrete Mathematics",
issn = "1571-0653",
publisher = "Elsevier",

}

RIS

TY - JOUR

T1 - Multimode extensions of combinatorial optimization problems

AU - Cordone, Roberto

AU - Lulli, Guglielmo

N1 - 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

PY - 2016/11

Y1 - 2016/11

N2 - 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).

AB - 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).

KW - Combinatorial Optimization;

KW - covering problems

KW - complexity

KW - Variable Neighborhood Search

U2 - 10.1016/j.endm.2016.10.005

DO - 10.1016/j.endm.2016.10.005

M3 - Journal article

VL - 55

SP - 17

EP - 20

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

SN - 1571-0653

ER -