An iterated local search for the budget constrained generalized maximal covering location problem

DOI10.1007/s10852-013-9233-9zbMath1308.90092OpenAlexW2083227290MaRDI QIDQ483216

Majid Salari

Publication date: 16 December 2014

Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-013-9233-9

zbMATH Keywords

coveringlocationiterated local searchemergency response

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Uses Software

• TSPLIB
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A genetic algorithm for solving a capacitated \(p\)-median problem
• Generalized coverage: new developments in covering location models
• The variable radius covering problem
• Analytical models for locating undesirable facilities
• Heuristic procedures for the m-partial cover problem on a plane
• The gradual covering decay location problem on a network.
• A column generation approach to capacitated \(p\)-median problems
• A note on the location of an obnoxious facility on a network
• The gradual covering problem
• An Analysis of Network Location Problems with Distance Constraints
• The Maximum Coverage Location Problem
• Note—On a Modified One-Center Model
• Obnoxious Facility Location on Graphs
• TSPLIB—A Traveling Salesman Problem Library
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• The generalized maximal covering location problem

This page was built for publication: An iterated local search for the budget constrained generalized maximal covering location problem