Multimode extensions of combinatorial optimization problems

DOI10.1016/j.endm.2016.10.005zbMath1356.90118OpenAlexW2555166074MaRDI QIDQ510906

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

complexitycombinatorial optimizationvariable neighborhood searchcovering problems

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) 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)

Cites Work

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

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