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

DOI10.15807/JORSJ.28.269MaRDI QIDQ3705191zbMATH OpenOpenAlexFDO

Authors 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

multifacility minimax location problemnetwork with no negative arc lengthsparametric shortest path problemrectilinear distances

Mathematics Subject Classification ID

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

Recommendations

• A multifacility location problem on median spaces
• Note on a Rectilinear Distance Round-Trip Location Problem
• An Efficient Algorithm for Solving the Rectilinear Multifacility Location Problem
• scientific article; zbMATH DE number 4199954
• An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem

Cited in

(8)

• A parametric critical path problem and an application for cyclic scheduling
• Optimal and approximate bottleneck Steiner trees
• Using tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance
• Algebraic solution of minimax single-facility constrained location problems with Chebyshev and rectilinear distances
• Solving Weber problem on plane with minimax criterion and forbidden gaps
• Note on a Rectilinear Distance Round-Trip Location Problem
• An Efficient Algorithm for Solving the Rectilinear Multifacility Location Problem
• scientific article; zbMATH DE number 1253055 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3705191)