Showing 1 - 10 of 27
1. The Linear Sum Assignment Problem -- 2. The Linear Bottleneck Assignment Problem -- 3. The Cardinality Matching Problem -- 4. The Sum Matching Problem -- 5. The Bottleneck Matching Problem -- 6. The Chinese Postman Problem -- 7. Quadratic Assignment Problems -- 8. QAP Heuristic 1: The method...
Persistent link: https://www.econbiz.de/10013520187
Persistent link: https://www.econbiz.de/10011795838
Persistent link: https://www.econbiz.de/10011874021
Persistent link: https://www.econbiz.de/10012242979
Persistent link: https://www.econbiz.de/10014437609
Persistent link: https://www.econbiz.de/10015184923
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 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
The inverse p-median problem with variable edge lengths on graphs is to modify the edge lengths at minimum total cost with respect to given modification bounds such that a prespecified set of p vertices becomes a p-median with respect to the new edge lengths. The problem is shown to be strongly <InlineEquation ID="IEq1">...</inlineequation>
Persistent link: https://www.econbiz.de/10010999831
Persistent link: https://www.econbiz.de/10005240206