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

DOI10.1016/j.cor.2008.02.011zbMath1175.90258MaRDI QIDQ960388

Vladimir Marianov, Michelle Mizumori, Charles S. Re Velle

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

heuristics; integer programming; facility location

Mathematics Subject Classification ID

90C10: Integer programming

90C59: Approximation methods and heuristics in mathematical programming

90B80: Discrete location and assignment

Related Items

A conditional \(p\)-hub location problem with attraction functions

Cites Work

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