The maximin-maxisum network location problem
From MaRDI portal
Publication:5938475
DOI10.1023/A:1011293604251zbMath0987.90052MaRDI QIDQ5938475
Frank Guangsheng Zhang, Emanuel Melachrinoudis
Publication date: 23 August 2001
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (9)
Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study ⋮ Undesirable facility location problems on multicriteria networks ⋮ Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions ⋮ A branch-and-cut method for the obnoxious \(p\)-median problem ⋮ The multicriteria \(p\)-facility median location problem on networks ⋮ Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network ⋮ Multiple criteria facility location problems: a survey ⋮ The Location of Undesirable Facilities ⋮ Obnoxious-facility location and data-envelopment analysis: a combined distance-based formula\-tion
This page was built for publication: The maximin-maxisum network location problem
