An \(O(mn)\) algorithm for the 1-maximin problem on a network
type: Item
instance of: scholarly article
title: An \(O(mn)\) algorithm for the 1-maximin problem on a network
zbMATH Open document ID: 0957.90018
DOI: 10.1016/S0305-0548(98)00099-9
author: Emanuel Melachrinoudis
author: Frank Guangsheng Zhang
published in: Computers \& Operations Research
publication date: 1999-11-23T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C47
zbMATH DE Number: 1339945
zbMATH Keywords: network location
zbMATH Keywords: undesirable facilities
zbMATH Keywords: maximin problem
MaRDI profile type: Publication
full work available at URL: s0305-0548(98)00099-9
OpenAlex ID: W2013279276
Recommended article: A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks
Recommended article: Q4007400
Recommended article: On a Network Generalization of the Minmax Theorem
Recommended article: On the approximability of minmax (regret) network optimization problems
Recommended article: Q4383576
Recommended article: Q3626409
Recommended article: An \(O(nm)\)-time network simplex algorithm for the shortest path problem
Recommended article: Algorithms and Computation
Recommended article: Approximation algorithms for degree-constrained minimum-cost network-design problems
Recommended article: On the complexity of min-max sorting networks
description: scientific article; zbMATH DE number 1339945