We study the p-median problem which is one of the classical problems in location theory. For p = 2 and on a two-dimensional mesh, we give an O (mn2q)-time algorithm for solving the problem, where, assuming that m ≥ n, m is the number of rows of the mesh containing demand points, n the number of columns containing demand points and q the number of demand points.link_to_subscribed_fulltex
We consider the p-median problem which is to find the location of p-facilitiesso as to minimize the ...
Abstract. Capacitated p-median problem (CPMP) is an important variation of facility location problem...
Graduation date: 2016Access restricted to the OSU Community, at author's request, from December 21, ...
Facility Location Problems have a great significance for allocating resources efficiently in a netwo...
[[abstract]]The p-median problem on a tree T is to find a set S of p vertices on T that minimize the...
The fundamental objectives of locating facilities can be summarized into three categories. The first...
The fundamental objectives of locating facilities can be summarized into three categories. The first...
AbstractThis paper deals with facility location problems with pos/neg weights in trees. We consider ...
This paper describes a branch-and-price algorithm for the p-median location problem. The objective i...
[[abstract]]©1992 Elsevier-The paper considers 2-dimensional mesh-connected computers with multiple ...
AbstractThe p-median problem on a tree T is to find a set S of p vertices on T that minimizes the su...
AbstractThis paper is concerned with the problem of locating n new facilities in the median space wh...
The p-median problem is a classic discrete location problem with several applications. It aims to op...
The P-median problem is a classical location model “par excellence”. In this paper we, first examine...
Motivated by the time-dependent location problem over T time-periods introduced in Maier and Hamach...
We consider the p-median problem which is to find the location of p-facilitiesso as to minimize the ...
Abstract. Capacitated p-median problem (CPMP) is an important variation of facility location problem...
Graduation date: 2016Access restricted to the OSU Community, at author's request, from December 21, ...
Facility Location Problems have a great significance for allocating resources efficiently in a netwo...
[[abstract]]The p-median problem on a tree T is to find a set S of p vertices on T that minimize the...
The fundamental objectives of locating facilities can be summarized into three categories. The first...
The fundamental objectives of locating facilities can be summarized into three categories. The first...
AbstractThis paper deals with facility location problems with pos/neg weights in trees. We consider ...
This paper describes a branch-and-price algorithm for the p-median location problem. The objective i...
[[abstract]]©1992 Elsevier-The paper considers 2-dimensional mesh-connected computers with multiple ...
AbstractThe p-median problem on a tree T is to find a set S of p vertices on T that minimizes the su...
AbstractThis paper is concerned with the problem of locating n new facilities in the median space wh...
The p-median problem is a classic discrete location problem with several applications. It aims to op...
The P-median problem is a classical location model “par excellence”. In this paper we, first examine...
Motivated by the time-dependent location problem over T time-periods introduced in Maier and Hamach...
We consider the p-median problem which is to find the location of p-facilitiesso as to minimize the ...
Abstract. Capacitated p-median problem (CPMP) is an important variation of facility location problem...
Graduation date: 2016Access restricted to the OSU Community, at author's request, from December 21, ...
DOI
Add to ORKG