Results 221 to 230 of about 585,264 (267)
Some of the next articles are maybe not open access.
IEEE/ACM Transactions on Networking, 2000
This paper studies the problem of where to place network caches. Emphasis is given to caches that are transparent to the clients since they are easier to manage and they require no cooperation from the clients. Our goal is to minimize the overall flow or the average delay by placing a given number of caches in the network.
P. Krishnan, Danny Raz, Yuval Shavitt
openaire +1 more source
This paper studies the problem of where to place network caches. Emphasis is given to caches that are transparent to the clients since they are easier to manage and they require no cooperation from the clients. Our goal is to minimize the overall flow or the average delay by placing a given number of caches in the network.
P. Krishnan, Danny Raz, Yuval Shavitt
openaire +1 more source
The mixed center location problem
Journal of Combinatorial Optimization, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yi Xu, Jigen Peng, Yinfeng Xu
openaire +2 more sources
Scheduling‐location problem with drones
International Transactions in Operational Research, 2023AbstractDrone operation, a new driving force for logistics innovation, is struggling to overcome practical challenges. One of the concerns for drone utilization is limited flight ranges, and different concepts of facilities are continually developed to support drone delivery.
Dongwook Kim, Ilkyeong Moon
openaire +2 more sources
A DSS for bicriteria location problems
Decision Support Systems, 2014In this paper, we present a new interactive decision support system (DSS) - named SABILOC - in action. The DSS is aimed at supporting decision-making concerning bicriteria location models and it was specially designed to deal with problems in which the facilities to be located have environmental impacts.
Sérgio Fernandes 0002 +2 more
openaire +2 more sources
Operations Research, 1963
The calculational aspects of solving certain classes of location-allocation problems are presented. Both exact extremal equations and a heuristic method are presented for solving these problems. Directions for further investigation are also indicated because of the need for methods to shorten the total amount of calculation involved.
openaire +1 more source
The calculational aspects of solving certain classes of location-allocation problems are presented. Both exact extremal equations and a heuristic method are presented for solving these problems. Directions for further investigation are also indicated because of the need for methods to shorten the total amount of calculation involved.
openaire +1 more source
The Maximum Availability Location Problem
Transportation Science, 1989A probabilistic version of the maximal covering location problem is introduced here. The maximum available location problem (MALP) positions p servers in such a way as to maximize the population which will find a server available within a time standard with α reliability.
Charles S. ReVelle, Kathleen B. Hogan
openaire +2 more sources
The Asymmetric Distance Location Problem
Transportation Science, 1989In many situations the distance between two points is not a symmetric function; i.e., the distance from A to B is different from the distance from B to A. This is typical, for example, in rush hour traffic. We consider four models: the minisum or minimax problems with rectilinear or Euclidean distances.
Zvi Drezner, George O. Wesolowsky
openaire +1 more source
A Punt Returner Location Problem
Operations Research, 1999We formulate and solve a location problem that determines where to position punt returners to maximize the number of punts caught. The problem is unusual within the location literature because it includes the dimension of time as well as Euclidean distance. The parameters of the model are estimated from actual punt return data.
Jack Brimberg +2 more
openaire +1 more source
The Latency Location-Routing Problem
European Journal of Operational Research, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohammad Moshref-Javadi, Seokcheon Lee
openaire +1 more source
Capacitated Location Problems on a Line
Transportation Science, 1996This paper examines capacitated facility location problems on a straight line. To serve a customer, a facility must be located within a corresponding customer neighborhood. The fixed costs of locating facilities and the unit production costs of serving a customer from a facility can depend upon their locations on the line. We discuss the computational
Prakash Mirchandani +2 more
openaire +2 more sources