John Gunnar Carlsson

According to our database, John Gunnar Carlsson authored at least 24 papers between 2010 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

A lossless a priori splitting rule for split-delivery routing problems.

Bo Jones, Julien Yu, John Gunnar Carlsson

CoRR, May, 2025

2024

Demand Equilibria in Spatial Service Systems.

John Gunnar Carlsson, Xiaoshan Peng, Ilya O. Ryzhov

Manuf. Serv. Oper. Manag., 2024

Provably Good Region Partitioning for On-Time Last-Mile Delivery.

John Gunnar Carlsson, Sheng Liu, Nooshin Salari, Han Yu

Oper. Res., 2024

2022

Topology and Local Optima in Computer Vision.

Erik Carlsson, John Gunnar Carlsson

SN Comput. Sci., 2022

Continuous approximation formulas for location problems.

John Gunnar Carlsson, Bo Jones

Networks, 2022

JD.com: Operations Research Algorithms Drive Intelligent Warehouse Robots to Work.

Hengle Qin, Jun Xiao, Dongdong Ge, Linwei Xin, Jianjun Gao, Simai He, Haodong Hu, John Gunnar Carlsson

INFORMS J. Appl. Anal., 2022

2018

Coordinated Logistics with a Truck and a Drone.

John Gunnar Carlsson, Siyuan Song

Manag. Sci., 2018

Wasserstein Distance and the Distributionally Robust TSP.

John Gunnar Carlsson, Mehdi Behroozi, Kresimir Mihic

Oper. Res., 2018

2017

Worst-case demand distributions in vehicle routing.

John Gunnar Carlsson, Mehdi Behroozi

Eur. J. Oper. Res., 2017

2016

Household-Level Economies of Scale in Transportation.

John Gunnar Carlsson, Mehdi Behroozi, Raghuveer Devulapalli, Xiangfei Meng

Oper. Res., 2016

Geometric partitioning and robust ad-hoc network design.

John Gunnar Carlsson, Mehdi Behroozi, Xiang Li

Ann. Oper. Res., 2016

2015

Continuous Facility Location with Backbone Network Costs.

John Gunnar Carlsson, Fan Jia

Transp. Sci., 2015

A Bottleneck Matching Problem with Edge-Crossing Constraints.

John Gunnar Carlsson, Benjamin Armbruster, Saladi Rahul, Haritha Bellam

Int. J. Comput. Geom. Appl., 2015

2014

An Approximation Algorithm for the Continuous k-Medians Problem in a Convex Polygon.

John Gunnar Carlsson, Fan Jia, Ying Li

INFORMS J. Comput., 2014

On the continuous Fermat-Weber problem for a convex polygon using Euclidean distance.

Thomas T. C. K. Zhang, John Gunnar Carlsson

CoRR, 2014

Spatial partitioning algorithms for data visualization.

Raghuveer Devulapalli, Mikael Quist, John Gunnar Carlsson

Proceedings of the Visualization and Data Analysis 2014, 2014

2013

A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension.

John Gunnar Carlsson, Jianming Shi

Oper. Res. Lett., 2013

Euclidean Hub-and-Spoke Networks.

John Gunnar Carlsson, Fan Jia

Oper. Res., 2013

Robust Partitioning for Stochastic Multivehicle Routing.

John Gunnar Carlsson, Erick Delage

Oper. Res., 2013

Dividing a Territory Among Several Facilities.

John Gunnar Carlsson, Raghuveer Devulapalli

INFORMS J. Comput., 2013

Balancing workloads of service vehicles over a geographic territory.

John Gunnar Carlsson, Erik Carlsson, Raghuveer Devulapalli

Proceedings of the 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2013

2012

Dividing a Territory Among Several Vehicles.

John Gunnar Carlsson

INFORMS J. Comput., 2012

2011

Dynamic Network Models

Benjamin Armbruster, John Gunnar Carlsson

CoRR, 2011

2010

Finding equitable convex partitions of points in a polygon efficiently.

John Gunnar Carlsson, Benjamin Armbruster, Yinyu Ye

ACM Trans. Algorithms, 2010