Multimode extensions of combinatorial optimization problems

DOI10.1016/J.ENDM.2016.10.005MaRDI QIDQ510906zbMATH OpenOpenAlexFDO

Authors Roberto Cordone, Guglielmo Lulli

Publication date 14 February 2017

Full work available at URL https://eprints.lancs.ac.uk/id/eprint/82497/1/MMinCO.pdf

zbMATH Keywords

combinatorial optimizationcomplexitycovering problemsvariable neighborhood search

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A variable neighborhood search algorithm for the multimode set covering problem
• The multimode covering location problem
• Variable neighborhood search: Principles and applications
• The multicovering problem
• Variable Neighborhood Search

Cites work

• A probabilistic analysis of the maximal covering location problem
• A variable neighborhood search algorithm for the multimode set covering problem
• An Extension of the Lovász Local Lemma, and its Applications to Integer Programming
• The multimode covering location problem

Cited in

(1)

• A variable neighborhood search algorithm for the multimode set covering problem

This page was built for publication: Multimode extensions of combinatorial optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510906)