The multimode covering location problem

DOI10.1016/J.COR.2015.09.003MaRDI QIDQ342251zbMATH OpenOpenAlexFDO

Authors Fabio Colombo, Roberto Cordone, Guglielmo Lulli

Publication date 17 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

variable neighborhood searchheuristic concentrationmaximal covering location problemvery large scale neighborhood search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Discrete location and assignment (90B80)

Recommendations

• The generalized maximal covering location problem
• An exact solution framework for the multiple gradual cover location problem
• Multi-type maximal covering location problems: hybridizing discrete and continuous problems
• The maximin gradual cover location problem
• The large-scale dynamic maximal covering location problem
• The Maximal Expected Covering Location Problem: Revisited
• The multicovering problem
• scientific article; zbMATH DE number 5990408
• The \(K\)-coverage concentrator location problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A GRASP metaheuristic for microarray data analysis
• A bibliography for some fundamental problem categories in discrete location science
• A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
• A multiperiod set covering location model for dynamic redeployment of ambulances
• A probabilistic analysis of the maximal covering location problem
• Facility location and supply chain management. A review
• Facility location with red-blue demands
• Generalized coverage: new developments in covering location models
• Introduction to algorithms
• Rationalizing Tool Selection in a Flexible Manufacturing System for Sheet-Metal Products
• Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model
• Solving the maximal covering location problem with heuristic concentration
• The capacitated plant location problem with multiple facilities in the same site
• Variable neighbourhood search: methods and applications

Cited in

(13)

• Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
• scientific article; zbMATH DE number 1253041 (Why is no real title available?)
• Effects of multipurpose shopping trips on retail store location in a duopoly
• Multi-period stochastic covering location problems: modeling framework and solution approach
• A VNS-LP algorithm for the robust dynamic maximal covering location problem
• scientific article; zbMATH DE number 758441 (Why is no real title available?)
• scientific article; zbMATH DE number 5990408 (Why is no real title available?)
• A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover
• A location-or-routing problem with partial and decaying coverage
• An improved lower bound for the multimedian location problem
• Algorithms and Data Structures
• Multimode extensions of combinatorial optimization problems
• A variable neighborhood search algorithm for the multimode set covering problem

This page was built for publication: The multimode covering location problem

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