About: Weber problem     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatEconomicProblems, within Data Space : dbpedia.org associated with source document(s)

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.

AttributesValues
rdf:type
rdfs:label
  • Problème de Weber
  • Weber problem
rdfs:comment
  • Le problème de Weber est l’un des problèmes les plus célèbres de la théorie de la localisation. Il généralise le problème de Fermat et il a lui-même été généralisé par le problème d’attraction-répulsion.
  • 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.
sameAs
dct:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
foaf:depiction
  • External Image
foaf:isPrimaryTopicOf
thumbnail
prov:wasDerivedFrom
has abstract
  • Le problème de Weber est l’un des problèmes les plus célèbres de la théorie de la localisation. Il généralise le problème de Fermat et il a lui-même été généralisé par le problème d’attraction-répulsion.
  • 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 computing the Fermat point, the geometric median of three points. For this reason it is sometimes called the Fermat–Weber problem, although the same name has also been used for the unweighted geometric median problem. The Weber problem is in turn generalized by the attraction–repulsion problem, which allows some of the costs to be negative, so that greater distance from some points is better.
id
  • p/w120040
title
  • Weber problem
http://purl.org/voc/vrank#hasRank
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git39 as of Aug 09 2019


Alternative Linked Data Documents: PivotViewer | iSPARQL | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3235 as of Sep 1 2020, on Linux (x86_64-generic-linux-glibc25), Single-Server Edition (61 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2020 OpenLink Software