An \(O(mn)\) algorithm for the 1-maximin problem on a network
From MaRDI portal
Publication:1304521
DOI10.1016/S0305-0548(98)00099-9zbMath0957.90018OpenAlexW2013279276MaRDI QIDQ1304521
Emanuel Melachrinoudis, Frank Guangsheng Zhang
Publication date: 23 November 1999
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00099-9
Minimax problems in mathematical programming (90C47) Deterministic network models in operations research (90B10)
Related Items (6)
A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks ⋮ Undesirable facility location problems on multicriteria networks ⋮ An \(O(mn)\) algorithm for the anti-cent-dian problem ⋮ Network location of a reliable center using the most reliable route policy ⋮ Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives ⋮ The Location of Undesirable Facilities
This page was built for publication: An \(O(mn)\) algorithm for the 1-maximin problem on a network
