An iterated local search for the budget constrained generalized maximal covering location problem
type: Item
instance of: scholarly article
title: An iterated local search for the budget constrained generalized maximal covering location problem
zbMATH Open document ID: 1308.90092
author: Majid Salari
published in: Journal of Mathematical Modelling and Algorithms in Operations Research
publication date: 2014-12-16T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6380801
zbMATH Keywords: location
zbMATH Keywords: covering
zbMATH Keywords: emergency response
zbMATH Keywords: iterated local search
describes a project that uses: CPLEX
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: s10852-013-9233-9
OpenAlex ID: W2083227290
cites work: A note on the location of an obnoxious facility on a network
cites work: The generalized maximal covering location problem
cites work: The gradual covering decay location problem on a network.
cites work: The variable radius covering problem
cites work: Generalized coverage: new developments in covering location models
cites work: Q3147658
cites work: Note—On a Modified One-Center Model
cites work: The gradual covering problem
cites work: Analytical models for locating undesirable facilities
cites work: Q3971521
cites work: A column generation approach to capacitated \(p\)-median problems
cites work: The Maximum Coverage Location Problem
cites work: An Analysis of Network Location Problems with Distance Constraints
cites work: Capacitated clustering problems by hybrid simulated annealing and tabu search
cites work: Q3147657
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: A genetic algorithm for solving a capacitated \(p\)-median problem
cites work: Obnoxious Facility Location on Graphs
cites work: Heuristic procedures for the m-partial cover problem on a plane
DOI: 10.1007/S10852-013-9233-9
description: scientific article; zbMATH DE number 6380801