Two lower-bounding algorithms for the p-center problem in an area
Y Liu - Computational Urban Science, 2022 - Springer
… constant-factor approximation algorithms for convex … form the node set of a connected graph
whose maximum link length is … the case that all but one of the p centers can move freely in a …
whose maximum link length is … the case that all but one of the p centers can move freely in a …
Continuous center problems
Z Drezner - Foundations of location analysis, 2011 - Springer
… convex hull to start the algorithm, we can select the first vertex as the one with smallest value
of x, and finding the adjacent vertex as the one with the largest slope (positive or negative) …
of x, and finding the adjacent vertex as the one with the largest slope (positive or negative) …
Neighbourhood Reduction in Global and Combinatorial Optimization: The Case of the p-Centre Problem
S Salhi, J Brimberg - Contributions to Location Analysis: In Honor of Zvi …, 2019 - Springer
… This optimal algorithm was originally very slow but has since developed into a fast and
powerful approach that can solve large instances to optimality. This is achieved by incorporating …
powerful approach that can solve large instances to optimality. This is achieved by incorporating …
Distance domination in graphs
MA Henning - Topics in Domination in Graphs, 2020 - Springer
… if there is an XP approximation algorithm for computing mim-width… to location problems,
p-centers in graphs have been … least δ ≥ 1, we can obtain a graph with minimum degree at least …
p-centers in graphs have been … least δ ≥ 1, we can obtain a graph with minimum degree at least …
An edge-based stochastic facility location problem in UAV-supported humanitarian relief logistics: a case study of Tehran earthquake
M Golabi, SM Shavarani, G Izbirak - Natural Hazards, 2017 - Springer
… As the UAVs’ flying speed, the traveling speed of people along the network edges is … As
discussed earlier, the median problems on a general graph are NP-hard problems. Further, …
discussed earlier, the median problems on a general graph are NP-hard problems. Further, …
Fast and scalable evaluation of pairwise potentials
… high particle counts spend considerable time in the L2O stage. Those with the most particles
stick out in these plots… have presented a fast, adaptive, and scalable algorithm for evaluating …
stick out in these plots… have presented a fast, adaptive, and scalable algorithm for evaluating …
A Bayesian Optimization Model for Locating Emergency Service Units
C Hua, A Swersey, W Xing - Available at SSRN 4497957, 2023 - papers.ssrn.com
… apply an efficient approximation algorithm for the hypercube … The kernel includes the Kronecker
delta function δ(xi,x′ … The plots show how the surrogate model is updated based on the …
delta function δ(xi,x′ … The plots show how the surrogate model is updated based on the …
Optimization for Calibration of Water Resources Systems Including New Parallel Global Algorithms and Applications to Hydrodynamics and Water Quality Lake PDE …
X Wei - 2020 - search.proquest.com
… assistance of High-Performance Computing (HPC). PODS outperforms state-of-art parallel
surrogate algorithms, and … The speed of PODS to obtain an accurate answer is about twice as …
surrogate algorithms, and … The speed of PODS to obtain an accurate answer is about twice as …
A Multiscale Deep‐Learning Model for Atom Identification from Low‐Signal‐to‐Noise‐Ratio Transmission Electron Microscopy Images
… The AtomID-Net model was trained at an initial learning rate of 10 −3 on a single graphics
… can address this issue faster, making it more practical (Figure S2, Supporting Information). …
… can address this issue faster, making it more practical (Figure S2, Supporting Information). …
Curves and Surfaces
RV Klassen - Graphics Gems IV, 1994 - books.google.com
… Describes a fast technique for subdivision of B-spline curves and surfaces. Subdivision is a
… " of life-tables, but we can take advantage of his method for present-day computer graphics. …
… " of life-tables, but we can take advantage of his method for present-day computer graphics. …