The heuristic concentration-integer and its application to a class of location problems

DOI10.1016/J.COR.2008.02.011MaRDI QIDQ960388zbMATH OpenOpenAlexFDO

Authors Vladimir Marianov, Michelle Mizumori, C. S. Revelle

Publication date 17 December 2008

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

Full work available at URL http://hdl.handle.net/10533/142396

zbMATH Keywords

facility locationheuristicsinteger programming

Mathematics Subject Classification ID

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

Recommendations

• Solving the maximal covering location problem with heuristic concentration
• A gamma heuristic for the \(p\)-median problem
• Heuristic concentration and tabu search: A head to head comparison
• Heuristic concentration for the p-median: An example demonstrating how and why it works
• Heuristic concentration: Two stage solution construction

Cites work

• A gamma heuristic for the \(p\)-median problem
• A Lagrangean heuristic for the maximal covering location problem
• Heuristic concentration and tabu search: A head to head comparison
• Heuristic concentration for the p-median: An example demonstrating how and why it works
• Heuristic concentration: Two stage solution construction
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• The Maximum Availability Location Problem
• The queueing maximal availability location problem: A model for the siting of emergency vehicles
• Towards unified formulations and extensions of two classical probabilistic location models

Cited in

(7)

• A gamma heuristic for the \(p\)-median problem
• Solving the maximal covering location problem with heuristic concentration
• On statistical bounds of heuristic solutions to location problems
• Constructive heuristics for the uncapacitated continuous location-allocation problem
• Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
• Déploiement et Redéploiement des Véhicules Ambulanciers dans la Gestion d'un Service Préhospitalier d'Urgence
• A conditional p-hub location problem with attraction functions

This page was built for publication: The heuristic concentration-integer and its application to a class of location problems

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