The ordered gradual covering location problem on a network

DOI10.1016/j.dam.2009.08.003zbMath1228.90015OpenAlexW2155055408MaRDI QIDQ967440

Dmitry Krass, Oded Berman, Stefan Nickel, Jörg Kalcsics

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1993

zbMATH Keywords

network locationordered median functiongradual covering

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (4)

Minmax regret maximal covering location problems with edge demands ⋮ Generalized coverage: new developments in covering location models ⋮ Single-allocation ordered median hub location problems ⋮ A separation based optimization approach to dynamic maximal covering location problems with switched structure

Cites Work

• An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure
• Analytical models for locating undesirable facilities
• The gradual covering decay location problem on a network.
• Algorithmic results for ordered median problems
• Location Theory
• Multifacility ordered median problems on networks: A further analysis
• The generalized maximal covering location problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The ordered gradual covering location problem on a network