A Geometry-Based Approach for Solving the Transportation Problem with Euclidean Cost

On the translocation of masses

Leonid Vitalievich Kantorovich · 1942

Earlier work this paper cites.

Convergence conditions for ascent methods

Philip Wolfe · 1969

Earlier work this paper cites.

Convergence conditions for ascent methods. II: Some corrections

Original

Philip Wolfe · 1971

Earlier work this paper cites.

Updating quasi-Newton matrices with limited storage

Jorge Nocedal · 1980

Earlier work this paper cites.

Minkowski-type theorems and least-squares clustering

Franz Aurenhammer, Friedrich Hoffmann, and Boris Aronov · 1998

Cited alongside, same era.

Dynamic additively weighted Voronoi diagrams in 2D

Menelaos I Karavelas and Mariette Yvinec · 2002

Cited alongside, same era.

The planar k-means problem is NP-hard

Meena Mahajan, Prajakta Nimbhorkar, and Kasturi Varadarajan · 2009

Cited alongside, same era.

libLBFGS (Version 1.10)

Naoaki Okazaki and Jorge Nocedal · 2010

Cited alongside, same era.

Mémoire sur la théorie des déblais et des remblais

Gaspard Monge

Cited in the paper.

A multiscale approach to optimal transport

Quentin Mérigot · 2011

Later among the works it cites.

Optimally solving a transportation problem using Voronoi diagrams

Darius Geiß, Rolf Klein, Rainer Penninger, and Günter Rote · 2013

Later among the works it cites.

http://www.cgal.org, 2015

CGAL, Computational Geometry Algorithms Library (Version 4.6.1) · 2015

Later among the works it cites.