MINIMAX LOCATION PROBLEM WITH A-DISTANCE

DOI10.15807/JORSJ.41.181MaRDI QIDQ4538098zbMATH OpenOpenAlexFDO

Authors T. Matsutomi, Hiroaki Ishii

Publication date 11 July 2002

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.41.181

zbMATH Keywords

ambulance service stationpolygonal areasingle facility location problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Nonlinear programming (90C30)

Recommendations

• Minisum location problem with farthest Euclidean distances
• Minimax location with farthest Euclidean distances
• The Minisum and Minimax Location Problems Revisited
• A new algorithm for the minimax location problem with the closest distance
• A SINGLE FACILITY MINISUM LOCATION PROBLEM UNDER THE A-DISTANCE
• A comment on a minmax location problem
• The Solution of Distance Constrained Mini-Sum Location Problems
• A Mini-Max Location Problem with Demand Points Arbitrarily Distributed in a Compact Connected Space
• A probabilistic minimax location problem on the plane
• Some constrained minimax and maximin location problems

Cited in

(10)

• Minisum location with closest Euclidean distances
• Fuzzy facility location problem with preference of candidate sites
• A minisum location problem with regional demand considering farthest Euclidean distances
• A hybrid algorithm for linearly constrained minimax problems
• Ambulance service facility location problem
• The Minisum and Minimax Location Problems Revisited
• scientific article; zbMATH DE number 91391 (Why is no real title available?)
• A SINGLE FACILITY MINISUM LOCATION PROBLEM UNDER THE A-DISTANCE
• Multifacility minimax location problems via multi-composed optimization
• Minisum location problem with farthest Euclidean distances

This page was built for publication: MINIMAX LOCATION PROBLEM WITH A-DISTANCE

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