A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES

DOI10.15807/jorsj.28.269zbMath0582.90029OpenAlexW2726448539MaRDI QIDQ3705191

Tetsuo Ichimori

Publication date: 1985

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.28.269

zbMATH Keywords

rectilinear distancesparametric shortest path problemmultifacility minimax location problemnetwork with no negative arc lengths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)

Related Items (3)

Solving Weber problem on plane with minimax criterion and forbidden gaps ⋮ Optimal and approximate bottleneck Steiner trees ⋮ A parametric critical path problem and an application for cyclic scheduling

This page was built for publication: A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES