default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Gunnar Carlsson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]John Gunnar Carlsson
, Sheng Liu, Nooshin Salari, Han Yu:
Provably Good Region Partitioning for On-Time Last-Mile Delivery. Oper. Res. 72(1): 91-109 (2024)- 2022
- [j17]Hengle Qin, Jun Xiao, Dongdong Ge, Linwei Xin, Jianjun Gao, Simai He, Haodong Hu, John Gunnar Carlsson:
JD.com: Operations Research Algorithms Drive Intelligent Warehouse Robots to Work. INFORMS J. Appl. Anal. 52(1): 42-55 (2022) - [j16]John Gunnar Carlsson, Bo Jones:
Continuous approximation formulas for location problems. Networks 80(4): 407-430 (2022) - [j15]Erik Carlsson, John Gunnar Carlsson:
Topology and Local Optima in Computer Vision. SN Comput. Sci. 3(2): 138 (2022)
2010 – 2019
- 2018
- [j14]John Gunnar Carlsson, Mehdi Behroozi, Kresimir Mihic:
Wasserstein Distance and the Distributionally Robust TSP. Oper. Res. 66(6): 1603-1624 (2018) - [j13]John Gunnar Carlsson, Siyuan Song:
Coordinated Logistics with a Truck and a Drone. Manag. Sci. 64(9): 4052-4069 (2018) - 2017
- [j12]John Gunnar Carlsson, Mehdi Behroozi:
Worst-case demand distributions in vehicle routing. Eur. J. Oper. Res. 256(2): 462-472 (2017) - 2016
- [j11]John Gunnar Carlsson, Mehdi Behroozi, Xiang Li:
Geometric partitioning and robust ad-hoc network design. Ann. Oper. Res. 238(1-2): 41-68 (2016) - [j10]John Gunnar Carlsson, Mehdi Behroozi, Raghuveer Devulapalli, Xiangfei Meng:
Household-Level Economies of Scale in Transportation. Oper. Res. 64(6): 1372-1387 (2016) - 2015
- [j9]John Gunnar Carlsson, Benjamin Armbruster, Saladi Rahul, Haritha Bellam:
A Bottleneck Matching Problem with Edge-Crossing Constraints. Int. J. Comput. Geom. Appl. 25(4): 245-262 (2015) - [j8]John Gunnar Carlsson, Fan Jia:
Continuous Facility Location with Backbone Network Costs. Transp. Sci. 49(3): 433-451 (2015) - 2014
- [j7]John Gunnar Carlsson, Fan Jia, Ying Li:
An Approximation Algorithm for the Continuous k-Medians Problem in a Convex Polygon. INFORMS J. Comput. 26(2): 280-289 (2014) - [c2]Raghuveer Devulapalli, Mikael Quist, John Gunnar Carlsson:
Spatial partitioning algorithms for data visualization. Visualization and Data Analysis 2014: 90170V - [i2]Thomas T. C. K. Zhang, John Gunnar Carlsson:
On the continuous Fermat-Weber problem for a convex polygon using Euclidean distance. CoRR abs/1403.3715 (2014) - 2013
- [j6]John Gunnar Carlsson, Raghuveer Devulapalli:
Dividing a Territory Among Several Facilities. INFORMS J. Comput. 25(4): 730-742 (2013) - [j5]John Gunnar Carlsson, Erick Delage:
Robust Partitioning for Stochastic Multivehicle Routing. Oper. Res. 61(3): 727-744 (2013) - [j4]John Gunnar Carlsson, Fan Jia:
Euclidean Hub-and-Spoke Networks. Oper. Res. 61(6): 1360-1382 (2013) - [j3]John Gunnar Carlsson, Jianming Shi:
A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension. Oper. Res. Lett. 41(4): 381-389 (2013) - [c1]John Gunnar Carlsson, Erik Carlsson, Raghuveer Devulapalli:
Balancing workloads of service vehicles over a geographic territory. IROS 2013: 209-216 - 2012
- [j2]John Gunnar Carlsson:
Dividing a Territory Among Several Vehicles. INFORMS J. Comput. 24(4): 565-577 (2012) - 2011
- [i1]Benjamin Armbruster, John Gunnar Carlsson:
Dynamic Network Models. CoRR abs/1103.2843 (2011) - 2010
- [j1]John Gunnar Carlsson, Benjamin Armbruster, Yinyu Ye:
Finding equitable convex partitions of points in a polygon efficiently. ACM Trans. Algorithms 6(4): 72:1-72:19 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
