Weber problem
id:
weber-problem-163-6703471
title:
Weber problem
text:
In geometry, the Weber problem, named after Alfred Weber, is one of the most famous problems in location theory. It requires finding a point in the plane that minimizes the sum of the transportation costs from this point to n destination points, where different destination points are associated with different costs per unit distance. The Weber problem generalizes the geometric median, which assumes transportation costs per unit distance are the same for all destination points, and the problem of
brand slug:
wiki
category slug:
encyclopedia
description:
Problem of minimizing sum of transport costs
original url:
https://en.wikipedia.org/wiki/Weber_problem
date created:
2013-07-26T20:37:55Z
date modified:
2024-08-28T09:41:46Z
main entity:
{"identifier":"Q14325966","url":"https://www.wikidata.org/entity/Q14325966"}
image:
fields total:
13
integrity:
15