Die vorliegende Masterarbeit beschäftigt sich mit den MINISUM-Modellen auf einem Graphen. Die Eigenschaften des „generalized“ p-Median-Problem werden neben den Eigenschaften des ordinären p-Median-Problems untersucht. Dabei kommt folgende Diskrepanz zum Vorschein: Obwohl das „generalized“ p-Median-Problem eine unendliche Anzahl an potenziellen Lösungsmöglichkeiten besitzt und der optimale Standort bei einer derartigen Problemstellung sowohl im Knoten als auch auf der Kante des Graphen liegen kann, wird der Median oft ausschließlich in den Knoten des Graphen gesucht. Dadurch entsteht das Risiko, dass beim Lösen des Problems der optimale Standort von Anfang an nicht mitberücksichtigt wird. Die Forschungsaufgabe dieser Arbeit ist, das „general...
Given a directed graph G(V,A), the p-Median problem consists of determining p nodes (the median node...
In past decades there has been a tremendous growth in the literature on location problems. However, ...
The p-median problem seeks for the location of p facilities on the vertices (customers) of a graph t...
El problema de la p-mediana es fundamental para gran parte de la teoría de localización discreta. Es...
The p-median problem is a graph theory problem that was originally designed for, and has been extens...
The P-median problem is a classical location model “par excellence”. In this paper we, first examine...
In this paper, we use a pseudo-Boolean formulation of the p-median problem and using data aggregatio...
A localização de p-medianas é um problema clássico de otimização combinatória. O objetivo é localiza...
In dieser Arbeit untersuchen wir die Platzierung von Mediangeraden mit einer Beschränkung der Steigu...
AbstractThe inverse p-median problem consists in changing the weights of the customers of a p-median...
The Super-Peer Selection Problem is an optimization problem in network topology construction. It may...
Abstract. Capacitated p-median problem (CPMP) is an important variation of facility location problem...
Les textes publiés dans la série des rapports de recherche HEC n’engagent que la responsabilite ́ ...
Die tägliche Überbrückung von Transportstrecken, sowie die Realisierung von Lagerstandorten stellen ...
In this paper, we propose a new method for solving large scale p-median problem instances based on r...
Given a directed graph G(V,A), the p-Median problem consists of determining p nodes (the median node...
In past decades there has been a tremendous growth in the literature on location problems. However, ...
The p-median problem seeks for the location of p facilities on the vertices (customers) of a graph t...
El problema de la p-mediana es fundamental para gran parte de la teoría de localización discreta. Es...
The p-median problem is a graph theory problem that was originally designed for, and has been extens...
The P-median problem is a classical location model “par excellence”. In this paper we, first examine...
In this paper, we use a pseudo-Boolean formulation of the p-median problem and using data aggregatio...
A localização de p-medianas é um problema clássico de otimização combinatória. O objetivo é localiza...
In dieser Arbeit untersuchen wir die Platzierung von Mediangeraden mit einer Beschränkung der Steigu...
AbstractThe inverse p-median problem consists in changing the weights of the customers of a p-median...
The Super-Peer Selection Problem is an optimization problem in network topology construction. It may...
Abstract. Capacitated p-median problem (CPMP) is an important variation of facility location problem...
Les textes publiés dans la série des rapports de recherche HEC n’engagent que la responsabilite ́ ...
Die tägliche Überbrückung von Transportstrecken, sowie die Realisierung von Lagerstandorten stellen ...
In this paper, we propose a new method for solving large scale p-median problem instances based on r...
Given a directed graph G(V,A), the p-Median problem consists of determining p nodes (the median node...
In past decades there has been a tremendous growth in the literature on location problems. However, ...
The p-median problem seeks for the location of p facilities on the vertices (customers) of a graph t...