Results 231 to 240 of about 585,264 (267)
Some of the next articles are maybe not open access.
Location, Location, Location: The Geography of the Dot Com Problem
Environment and Planning B: Planning and Design, 2001Cyberspace is often portrayed as a seamless expanse, with browsers of the web rarely made aware of the geographic location of a page. For all its professed aspatiality, however, analysis of the organization of cyberspace offers continuing proof of the presence of geographically determined influences. Beyond the core domain names suffixes (.com, .gov, .
openaire +2 more sources
The Tree of Hubs Location Problem
European Journal of Operational Research, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Iván A. Contreras +2 more
openaire +2 more sources
A Dynamic location problem for graphs
Combinatorica, 1989zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fan R. K. Chung +2 more
openaire +1 more source
Spherical Minimax Location Problem
Computational Optimization and Applications, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pratibhamoy Das +2 more
openaire +1 more source
The Euclidean Multifacility Location Problem
Operations Research, 1988To solve the Euclidean multifacility location problem, W. Miehle extended the Weiszfeld algorithm from one to several facilities. L. M. Ostresh established that the objective function for the iterates of Miehle's algorithm decreases in value, but his results do not give a convergence proof.
openaire +2 more sources
A location-driven approach for warehouse location problem
Journal of the Operational Research Society, 2020After a large-scale disaster occurred, medical service centers are needed to provide appropriate medical treatments for injured patients.
openaire +1 more source
Operations Research Letters, 1985
Recent developments for several location problems are surveyed. These include: graph theoretic and combinatorial formulations of the simple plant location problem, the NP-hardness of some p-center problems, worst- case bounds for several polynomial-time heuristics for some p-center problems, and a general solution to a class of one facility network ...
openaire +1 more source
Recent developments for several location problems are surveyed. These include: graph theoretic and combinatorial formulations of the simple plant location problem, the NP-hardness of some p-center problems, worst- case bounds for several polynomial-time heuristics for some p-center problems, and a general solution to a class of one facility network ...
openaire +1 more source
Reverse facility location problems. [PDF]
, 2005 info:eu-repo/semantics ...
Cabello, Sergio +4 more
openaire +1 more source