1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.DS2025
A lossless a priori splitting rule for split-delivery routing problems
Bo Jones, Julien Yu, John Gunnar Carlsson
Resource allocation problems in which demand is splittable are usually solved using different solution methods from their unsplittable equivalents. Although splittable problem inst…
math.AT2023★ 1 cited
Computing the alpha complex using dual active set methods
Erik Carlsson, John Carlsson
The alpha complex is a fundamental data structure from computational geometry, which encodes the topological type of a union of balls for , i…
cs.CG2014
On the continuous Fermat-Weber problem for a convex polygon using Euclidean distance
Thomas T. C. K. Zhang, John Gunnar Carlsson
We consider the continuous Fermat-Weber problem, where the customers are continuously (uniformly) distributed along the boundary of a convex polygon. We derive the closed-form expr…