Results 221 to 230 of about 1,088,242 (267)
Some of the next articles are maybe not open access.
The mixed center location problem
Journal of Combinatorial Optimization, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Yi, Peng, Jigen, Xu, Yinfeng
openaire +2 more sources
On alternativep-center problems
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research, 1992Summary: Let \(G=(V,E)\) be an undirected connected graph with positive edge lengths. The vertex \(p\)-center problem is to find the optimal location of \(p\) centers so that the maximum distance to a vertex from its nearest center is minimized, where the centers may be placed at the vertices. \textit{O. Kariv} and \textit{S. L. Hakimi} [SIAM J.
openaire +2 more sources
International Journal of Computational Geometry & Applications, 2011
In this paper we study several instances of the alignedk-center problem where the goal is, given a set of points S in the plane and a parameter k ⩾ 1, to find k disks with centers on a line ℓ such that their union covers S and the maximum radius of the disks is minimized.
Braß, Peter +4 more
openaire +2 more sources
In this paper we study several instances of the alignedk-center problem where the goal is, given a set of points S in the plane and a parameter k ⩾ 1, to find k disks with centers on a line ℓ such that their union covers S and the maximum radius of the disks is minimized.
Braß, Peter +4 more
openaire +2 more sources
The p-neighbor k-center problem
Information Processing Letters, 1998The k-center problem with triangle inequality is that of placing k center nodes in a weighted undirected graph in which the edge weights obey the triangle inequality, so that the maximum distance of any node to its nearest center is minimized. In this paper, we consider a generalization of this problem where, given a number p, we wish to place k ...
Chaudhuri, S., Garg, N., Ravi, R.
openaire +3 more sources
Transportation Science, 1989
It is shown that conditional p-center problems can be solved by solving O(log n) p-center problems where n is the number of demand points. Therefore, once an efficient algorithm exists for the p-center problem (by any metric or on a network), then an efficient one can be built for the conditional version of the problem.
openaire +1 more source
It is shown that conditional p-center problems can be solved by solving O(log n) p-center problems where n is the number of demand points. Therefore, once an efficient algorithm exists for the p-center problem (by any metric or on a network), then an efficient one can be built for the conditional version of the problem.
openaire +1 more source
Climate and Energy
“Hyperscale” data centers accompanying the rapid growth of artificial intelligence (AI) is one of the fastest growing uses of electricity in the United States and the rest of the world. Indeed, such growth, with the retirement of dispatchable fossil fuel electricity plants, drives persistent warnings about potential reliability problems for the US ...
Jeff D. Makholm, Laura T.W. Olive
openaire +1 more source
“Hyperscale” data centers accompanying the rapid growth of artificial intelligence (AI) is one of the fastest growing uses of electricity in the United States and the rest of the world. Indeed, such growth, with the retirement of dispatchable fossil fuel electricity plants, drives persistent warnings about potential reliability problems for the US ...
Jeff D. Makholm, Laura T.W. Olive
openaire +1 more source
SIAM Review, 1970
An m-center set of a graph is any set of m points, belonging either to the edges or vertices, that minimizes the maximum distance from a vertex to its nearest m-center. This paper presents a method for solving the m-center problem by solving a finite series of minimum set covering problems.
openaire +2 more sources
An m-center set of a graph is any set of m points, belonging either to the edges or vertices, that minimizes the maximum distance from a vertex to its nearest m-center. This paper presents a method for solving the m-center problem by solving a finite series of minimum set covering problems.
openaire +2 more sources
Vertex-centered and cell-centered multigrid for interface problems
Journal of Computational Physics, 1992By a finite volume discretization two kinds of multigrid differential methods are developed for solving two-dimensional diffusion equations with discontinuous or/and anisotropic coefficients across internal interfaces. The algorithmical aspects of the methods and computational results are discussed.
Khalil, M. (author) +1 more
openaire +3 more sources
Differentially private k-center problems
Optimization LetterszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fan Yuan, Dachuan Xu, Donglei Du, Min Li
openaire +1 more source
ON THE DEGENERATE CENTER PROBLEM
International Journal of Bifurcation and Chaos, 2011In this work, it is proved that any degenerate center is limit of a [Formula: see text] linear type center and when the degenerate center has an analytic first integral then it is limit of an analytic linear type center. A new method to detect integrability developed in [Giné & Santallusia, 2011] is applied to the degenerate center problem ...
openaire +1 more source