Distance-constrained multifacility minimax location problems on tree networks

DOI10.1002/net.3230220104zbMath0751.90043OpenAlexW2091331506MaRDI QIDQ3989543

Erhan Erkut, Richard L. Francis, Arie Tamir

Publication date: 28 June 1992

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230220104

zbMATH Keywords

polynomial algorithmstree networkmultifacility minimax location

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Related Items (4)

A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ A truncated aggregate smoothing Newton method for minimax problems ⋮ Public facility location using dispersion, population, and equity criteria ⋮ Minmax regret solutions for minimax optimization problems with uncertainty

Cites Work

• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Slowing down sorting networks to obtain faster sorting algorithms

This page was built for publication: Distance-constrained multifacility minimax location problems on tree networks