John Gunnar Carlsson

According to our database1, John Gunnar Carlsson authored at least 18 papers between 2010 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Coordinated Logistics with a Truck and a Drone.
Management Science, 2018

Wasserstein Distance and the Distributionally Robust TSP.
Operations Research, 2018

2017
Worst-case demand distributions in vehicle routing.
European Journal of Operational Research, 2017

2016
Household-Level Economies of Scale in Transportation.
Operations Research, 2016

Geometric partitioning and robust ad-hoc network design.
Annals OR, 2016

2015
Continuous Facility Location with Backbone Network Costs.
Transportation Science, 2015

A Bottleneck Matching Problem with Edge-Crossing Constraints.
Int. J. Comput. Geometry Appl., 2015

2014
An Approximation Algorithm for the Continuous k-Medians Problem in a Convex Polygon.
INFORMS Journal on Computing, 2014

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

Spatial partitioning algorithms for data visualization.
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.
Oper. Res. Lett., 2013

Euclidean Hub-and-Spoke Networks.
Operations Research, 2013

Robust Partitioning for Stochastic Multivehicle Routing.
Operations Research, 2013

Dividing a Territory Among Several Facilities.
INFORMS Journal on Computing, 2013

Balancing workloads of service vehicles over a geographic territory.
Proceedings of the 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2013

2012
Dividing a Territory Among Several Vehicles.
INFORMS Journal on Computing, 2012

2011
Dynamic Network Models
CoRR, 2011

2010
Finding equitable convex partitions of points in a polygon efficiently.
ACM Trans. Algorithms, 2010


  Loading...