Showing 1 - 10 of 2,948
distribution - discusses theoretical issues and models, based on international comparison, and using simulation economic models …
Persistent link: https://www.econbiz.de/10010966378
under construction for development policy simulation and regional planning - constitutes part of a WEP research project …
Persistent link: https://www.econbiz.de/10010966595
We study the problem of cooperative behavior emerging in an environment where individual behaviors and interaction structures coevolve. Players not only learn which strategy to adopt by imitating the strategy of the best-performing player they observe, but also choose with whom they should...
Persistent link: https://www.econbiz.de/10009191564
Persistent link: https://www.econbiz.de/10008575561
When dealing with location problems we are usually given a set of existing facilities and we are looking for the location of one or several new facilities. In the classical approaches weights are assigned to existing facilities expressing the importance of the new facilities for the existing...
Persistent link: https://www.econbiz.de/10010999596
Let a connected undirected graph G  =  (V, E) be given. In the classical p-median problem we want to find a set X containing p points in G such that the sum of weighted distances from X to all vertices in V is minimized. We consider the semi-obnoxious case where every vertex has either a...
Persistent link: https://www.econbiz.de/10010847753
Let T = (V, E) be a tree. A core of T is a path P, for which the sum of the weighted distances from all vertices to this path is minimized. In this paper, we consider the semi-obnoxious case in which the vertices have positive or negative weights. We prove that, when the sum of the weights of...
Persistent link: https://www.econbiz.de/10010847760
In this paper we look at two interesting extensions to the classical 2-Facility Weber Problem in ℝ d : At first problems are investigated where we do not allow the optimal locations to be in a specific region. Efficient algorithms for this Global Optimization problem are presented as well as...
Persistent link: https://www.econbiz.de/10010847766
Let a connected undirected graph G  =  (V, E) be given. In the classical p-median problem we want to find a set X containing p points in G such that the sum of weighted distances from X to all vertices in V is minimized. We consider the semi-obnoxious case where every vertex has either a...
Persistent link: https://www.econbiz.de/10010999773
Let T = (V, E) be a tree. A core of T is a path P, for which the sum of the weighted distances from all vertices to this path is minimized. In this paper, we consider the semi-obnoxious case in which the vertices have positive or negative weights. We prove that, when the sum of the weights of...
Persistent link: https://www.econbiz.de/10010999781