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

DOI10.1007/S10852-013-9233-9zbMATH Open1308.90092OpenAlexW2083227290MaRDI QIDQ483216FDOQ483216

Authors: 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

Recommendations

• The generalized maximal covering location problem
• Probabilistic partial set covering problems
• Iterated greedy algorithms for the maximal covering location problem
• The Maximal Covering Location Problem with Capacities on Total Workload
• A new reformulation approach for the generalized partial covering problem

zbMATH Keywords

locationcoveringiterated local searchemergency response

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• A facility location problem for extracurricular workshop planning: bi-level model and metaheuristics
• Intelligent-guided adaptive search for the maximum covering location problem
• A constructive proof of swap local search worst-case instances for the maximum coverage problem
• Iterated greedy algorithms for the maximal covering location problem

Uses Software

• TSPLIB
• CPLEX

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

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