Results 211 to 220 of about 601,506 (267)
Sport-specific injury profiles and associated factors in elite wrestlers and judokas. [PDF]
Front Public HealthSadır Y +10 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Operations Research, 1980
The problem considered is to locate a point in a given convex polyhedron which maximizes the minimum Euclidean distance from a given set of points. The paper describes several possible application areas and shows the existence of a finite set of candidates for the optimal solution.
Balakrishnan Dasarathy, Lee J. White
openaire +2 more sources
The problem considered is to locate a point in a given convex polyhedron which maximizes the minimum Euclidean distance from a given set of points. The paper describes several possible application areas and shows the existence of a finite set of candidates for the optimal solution.
Balakrishnan Dasarathy, Lee J. White
openaire +2 more sources
Networks, 1999
Summary: The problem of locating a set of depots in an arc routing context (with no side constraints) is addressed. In the case of one depot, it is shown that the problem can be transformed into a Rural Postman Problem (RPP). In the case of a set of depots, the problem is also reduced to an RPP if there are no bounds on the number of depots to be ...
GHIANI, GIANPAOLO, G. LAPORTE
openaire +4 more sources
Summary: The problem of locating a set of depots in an arc routing context (with no side constraints) is addressed. In the case of one depot, it is shown that the problem can be transformed into a Rural Postman Problem (RPP). In the case of a set of depots, the problem is also reduced to an RPP if there are no bounds on the number of depots to be ...
GHIANI, GIANPAOLO, G. LAPORTE
openaire +4 more sources
Naval Research Logistics Quarterly, 1982
AbstractThe joint problems of determining the optimal plant location and optimal input mix and plant size are addressed. The interrelationship between input substitutability and plant location is stressed. Conditions under which the location problem can be separated from the determination of the optimal input mix are developed for a number of problem ...
Hurter, Arthur P. jun. +1 more
openaire +2 more sources
AbstractThe joint problems of determining the optimal plant location and optimal input mix and plant size are addressed. The interrelationship between input substitutability and plant location is stressed. Conditions under which the location problem can be separated from the determination of the optimal input mix are developed for a number of problem ...
Hurter, Arthur P. jun. +1 more
openaire +2 more sources
On the symmetric location problem
IEEE Transactions on Robotics and Automation, 1998Accurate and efficient localization of symmetric features plays an important role in dimensional inspection of machined parts and machining of partially finished workpieces. We present a geometric theory for efficient and accurate localization of symmetric features.
Jianbo Gou, Yunxian Chu, Zexiang Li 0001
openaire +2 more sources
The expropriation location problem
Journal of the Operational Research Society, 2003Summary: We consider the location of a new obnoxious facility that serves only a certain proportion of the demand. Each demand point can be bought by the developer at a given price. An expropriation budget is given. Demand points closest to the facility are expropriated within the given budget.
Oded Berman +2 more
openaire +1 more source
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 +2 more sources
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 +2 more sources