On an extension of Weber problem with Euclidean distance

DOI10.1080/02331938508843083zbMath0593.05009OpenAlexW2072533980MaRDI QIDQ3722514

Janusz Kacprzyk, Wieslaw Stanczak

Publication date: 1985

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938508843083

zbMATH Keywords

location problemapproximation algorithmWeber problemnumerical complexity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Operations research and management science (90B99) Triple systems (05B07)

Cites Work

• Mathematical Models of Road Travel Distances
• An algorithm for the solution of a location problem with metric constraints
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• Modelling Inter-city Road Distances by Mathematical Functions
• A note on Fermat's problem

This page was built for publication: On an extension of Weber problem with Euclidean distance