-
Notifications
You must be signed in to change notification settings - Fork 0
/
optimal-transport.bib
550 lines (479 loc) · 14.4 KB
/
optimal-transport.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
@book{Ahuja:1993:NFT:137406,
author = {Ahuja, Ravindra K. and Magnanti, Thomas L. and Orlin, James B.},
title = {Network Flows: Theory, Algorithms, and Applications},
year = {1993},
isbn = {0-13-617549-X},
publisher = {Prentice-Hall, Inc.},
address = {Upper Saddle River, NJ, USA},
}
@Article{Tarjan1997,
author="Tarjan, Robert E.",
title="Dynamic trees as search trees via euler tours, applied to the network simplex algorithm",
journal="Mathematical Programming",
year="1997",
volume="78",
number="2",
pages="169--177"
}
@inproceedings{andoni:soda2008,
title={Earth mover distance over high-dimensional spaces},
author={Andoni, Alexandr and Indyk, Piotr and Krauthgamer, Robert},
booktitle={Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms},
pages={343--352},
year={2008},
organization={Society for Industrial and Applied Mathematics}
}
@article{angenent:jma2003,
title={Minimizing Flows for the Monge--Kantorovich Problem},
author={Angenent, Sigurd and Haker, Steven and Tannenbaum, Allen},
journal={SIAM journal on mathematical analysis},
volume={35},
number={1},
pages={61--97},
year={2003},
publisher={SIAM}
}
@article{appelgren:ts1969,
title={A column generation algorithm for a ship scheduling problem},
author={Appelgren, Leif H},
journal={Transportation Science},
volume={3},
number={1},
pages={53--68},
year={1969},
publisher={INFORMS}
}
@article{aurenhammer:algorithmica1998,
title={Minkowski-type theorems and least-squares clustering},
author={Aurenhammer, Franz and Hoffmann, Friedrich and Aronov, Boris},
journal={Algorithmica},
volume={20},
number={1},
pages={61--76},
year={1998},
publisher={Springer}
}
@article{assouad1983plongements,
title={Plongements lipschitziens dans $\mathbf{R}^p$},
author={Assouad, Patrice},
journal={Bulletin de la Soci{\'e}t{\'e} Math{\'e}matique de France},
volume={111},
pages={429--448},
year={1983}
}
@article{beckmann:eco1952,
jstor_articletype = {research-article},
title = {A Continuous Model of Transportation},
author = {Beckmann, Martin},
journal = {Econometrica},
volume = {20},
number = {4},
year = {1952},
publisher = {The Econometric Society},
}
@article{benamou:nm2000,
title={A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem},
author={Benamou, Jean-David and Brenier, Yann},
journal={Numerische Mathematik},
volume={84},
number={3},
pages={375--393},
year={2000},
publisher={Springer}
}
@article{benamou2014numerical,
title={Numerical solution of the Optimal Transportation problem using the Monge--Amp{\`e}re equation},
author={Benamou, Jean-David and Froese, Brittany D and Oberman, Adam M},
journal={Journal of Computational Physics},
volume={260},
pages={107--126},
year={2014},
publisher={Elsevier}
}
@article{bertsekas:or1988,
title={Relaxation methods for minimum cost ordinary and generalized network flow problems},
author={Bertsekas, Dimitri P and Tseng, Paul},
journal={Operations Research},
pages={93--114},
year={1988},
publisher={JSTOR}
}
@book{boyd2004convex,
title={Convex optimization},
author={Boyd, Stephen and Vandenberghe, Lieven},
year={2004},
publisher={Cambridge university press}
}
@article{bixby:informs1992,
title={Very large-scale linear programming: A case study in combining interior point and simplex methods},
author={Bixby, Robert E and Gregory, John W and Lustig, Irvin J and Marsten, Roy E and Shanno, David F},
journal={Operations Research},
volume={40},
number={5},
pages={885--897},
year={1992},
publisher={INFORMS}
}
@article{burger:amre2012,
title={Regularized regression and density estimation based on optimal transport},
author={Burger, Martin and Franek, Marzena and Sch{\"o}nlieb, Carola-Bibiane},
journal={Applied Mathematics Research eXpress},
volume={2012},
number={2},
pages={209--253},
year={2012},
publisher={Oxford University Press}
}
@article{brenier:cpam1991,
title={Polar factorization and monotone rearrangement of vector-valued functions},
author={Brenier, Yann},
journal={Communications on pure and applied mathematics},
volume={44},
number={4},
pages={375--417},
year={1991},
publisher={Wiley Online Library}
}
@ARTICLE{carli:arxiv2013,
author = {{Carli}, F.~P. and {Ning}, L. and {Georgiou}, T.~T.},
title = "{Convex Clustering via Optimal Mass Transport}",
journal = {ArXiv e-prints},
year = 2013,
month = jul,
}
@article{carlier:jcc2008,
title={Optimal transportation with traffic congestion and Wardrop equilibria},
author={Carlier, Guillaume and Jimenez, Chlo{\'e} and Santambrogio, Filippo},
journal={SIAM Journal on Control and Optimization},
volume={47},
number={3},
pages={1330--1350},
year={2008},
publisher={SIAM}
}
@book{cullen:book2006,
title={A mathematical theory of large-scale atmosphere/ocean flow},
author={Cullen, Michael JP},
year={2006},
publisher={World Scientific}
}
@article{cunningham:mp1976,
year={1976},
journal={Mathematical Programming},
volume={11},
number={1},
title={A network simplex method},
publisher={Springer-Verlag},
author={Cunningham, W.H.},
pages={105-116},
}
@article{cuturi:nips2013,
title={Sinkhorn Distances: Lightspeed Computation of Optimal Transportation},
author={Cuturi, Marco},
journal={Advances in Neural Information Processing Systems},
pages={2292--2300},
year={2013}
}
@article{cuturi:arxiv2013,
title={Fast computation of Wasserstein barycenters},
author={Cuturi, Marco and Doucet, Arnaud},
journal={International Conference on Machine Learning},
pages={685--693},
year={2014}
}
@article{cuturi:jmlr2014,
title={Ground Metric Learning},
author={Cuturi, Marco and Avis, David},
journal={Journal of Machine Learning Research},
volume={15},
number={February},
pages={533--564},
year={2014}
}
@book{desrosiers:book2005,
title={A primer in column generation},
author={Desrosiers, Jacques and L{\"u}bbecke, Marco E},
year={2005},
publisher={Springer}
}
@article{dantzig:transport1951,
title={Application of the simplex method to a transportation problem},
author={Dantzig, George B},
journal={Activity analysis of production and allocation},
volume={13},
pages={359--373},
year={1951}
}
@article{dantzig:informs1960,
title={Decomposition principle for linear programs},
author={Dantzig, George B and Wolfe, Philip},
journal={Operations research},
volume={8},
number={1},
pages={101--111},
year={1960},
publisher={INFORMS}
}
@book{desaulniers:book2002,
title={Accelerating strategies in column generation methods for vehicle
routing and crew scheduling problems},
author={Desaulniers, Guy and Desrosiers, Jacques and Solomon, Marius M},
year={2002},
publisher={Springer}
}
@inproceedings{degoes:cgf2011,
title={An optimal transport approach to robust reconstruction and simplification of 2d shapes},
author={De Goes, Fernando and Cohen-Steiner, David and Alliez, Pierre and Desbrun, Mathieu},
booktitle={Computer Graphics Forum},
volume={30},
number={5},
pages={1593--1602},
year={2011},
organization={Wiley Online Library}
}
@incollection{ferradans:lncs2013,
year={2013},
booktitle={Scale Space and Variational Methods in Computer Vision},
volume={7893},
series={Lecture Notes in Computer Science},
editor={Kuijper, Arjan and Bredies, Kristian and Pock, Thomas and Bischof, Horst},
title={Regularized Discrete Optimal Transport},
publisher={Springer Berlin Heidelberg},
author={Ferradans, Sira and Papadakis, Nicolas and Rabin, Julien and Peyré, Gabriel and Aujol, Jean-François},
pages={428-439}
}
@article{ford:ms1956,
title={Solving the transportation problem},
author={Ford, Lester Randolph and Fulkerson, DR},
journal={Management Science},
volume={3},
number={1},
pages={24--32},
year={1956},
publisher={INFORMS}
}
@article{ford:ms1958,
title={A suggested computation for maximal multi-commodity network flows},
author={Ford, Lester R and Fulkerson, Delbert R},
journal={Management Science},
volume={5},
number={1},
pages={97--101},
year={1958},
publisher={INFORMS}
}
@inproceedings{goldberg:stoc1987,
author = {Goldberg, A. and Tarjan, R.},
title = {Solving minimum-cost flow problems by successive approximation},
booktitle = {Proceedings of the nineteenth annual ACM symposium on Theory of computing},
series = {STOC '87},
year = {1987},
pages = {7--18},
publisher = {ACM},
address = {New York, NY, USA},
}
@article{gilmore:or1961,
title={A linear programming approach to the cutting-stock problem},
author={Gilmore, Paul C and Gomory, Ralph E},
journal={Operations research},
volume={9},
number={6},
pages={849--859},
year={1961},
publisher={INFORMS}
}
@article{haker:ijcv2004,
title={Optimal mass transport for registration and warping},
author={Haker, Steven and Zhu, Lei and Tannenbaum, Allen and Angenent, Sigurd},
journal={International Journal of Computer Vision},
volume={60},
number={3},
pages={225--240},
year={2004},
publisher={Springer}
}
@ARTICLE{glimm:arxiv2011,
title={Iterative scheme for solving optimal transportation problems arising in reflector design},
author={Glimm, Tilmann and Henscheid, Nick},
journal={ISRN Applied Mathematics},
volume={2013},
year={2013},
}
@article{indyk2003fast,
author = {P. Indyk and N. Thaper},
title = {Fast Image Retrieval via Embeddings},
journal = {3rd International Workshop on Statistical and Computational Theories of Vision},
year = {2003}
}
@article{iollo:jcp2011,
title = "A lagrangian scheme for the solution of the optimal mass transfer problem ",
journal = "Journal of Computational Physics ",
volume = "230",
number = "9",
pages = "3430 - 3442",
year = "2011",
note = "",
author = "Angelo Iollo and Damiano Lombardi",
}
@article{kantorovitch:ms1958,
title={On the translocation of masses},
author={Kantorovitch, Lo},
journal={Management Science},
volume={5},
number={1},
pages={1--4},
year={1958},
publisher={INFORMS}
}
@article{klein:ms1967,
title={A primal method for minimal cost flows with applications to the assignment and transportation problems},
author={Klein, Morton},
journal={Management Science},
volume={14},
number={3},
pages={205--220},
year={1967},
publisher={INFORMS}
}
@article{kuhn:nrlq1955,
title={The Hungarian method for the assignment problem},
author={Kuhn, Harold W},
journal={Naval research logistics quarterly},
volume={2},
number={1-2},
pages={83--97},
year={1955},
publisher={Wiley Online Library}
}
@ARTICLE{ling:pami2007,
author={Haibin Ling and Okada, K.},
journal={Pattern Analysis and Machine Intelligence, IEEE Transactions on},
title={ An Efficient Earth Mover's Distance Algorithm for Robust Histogram Comparison},
year={2007},
volume={29},
number={5},
pages={840-853}
}
@inproceedings{merigot:cgf2011,
title={A multiscale approach to optimal transport},
author={M{\'e}rigot, Quentin},
booktitle={Computer Graphics Forum},
volume={30},
pages={1583--1592},
year={2011},
organization={Wiley Online Library}
}
@book{monge:book1781,
title={M{\'e}moire sur la th{\'e}orie des d{\'e}blais et des remblais},
author={Monge, Gaspard},
year={1781},
publisher={De l'Imprimerie Royale}
}
@article{orlin:mp1997,
title={A polynomial time primal network simplex algorithm for minimum cost flows},
author={Orlin, James B},
journal={Mathematical Programming},
volume={78},
number={2},
pages={109--129},
year={1997},
publisher={Springer}
}
@article{oberman2015efficient,
title={An efficient linear programming method for optimal transportation},
author={Oberman, Adam M and Ruan, Yuanlong},
journal={arXiv preprint arXiv:1509.03668},
year={2015}
}
@inproceedings{pele:iccv2009,
title={Fast and robust earth mover's distances},
author={Pele, Ofir and Werman, Michael},
booktitle={Computer vision, 2009 IEEE 12th international conference on},
pages={460--467},
year={2009},
organization={IEEE}
}
@ARTICLE{papadakis:arxiv2013,
author = {{Papadakis}, N. and {Peyr{\'e}}, G. and {Oudet}, E.},
title = "{Optimal Transport with Proximal Splitting}",
journal = {ArXiv e-prints},
year = {2013},
month = {april}
}
@book{reinfeld:book1958,
title={Mathematical programming},
author={Reinfeld, Nyles V and Vogel, William R},
year={1958},
publisher={Prentice-Hall}
}
@article{rubner2000earth,
title={The earth mover's distance as a metric for image retrieval},
author={Rubner, Yossi and Tomasi, Carlo and Guibas, Leonidas J},
journal={International Journal of Computer Vision},
volume={40},
number={2},
pages={99--121},
year={2000},
publisher={Springer}
}
@inproceedings{rubner:iccv1998,
title={A metric for distributions with applications to image databases},
author={Rubner, Yossi and Tomasi, Carlo and Guibas, Leonidas J},
booktitle={Computer Vision, 1998. Sixth International Conference on},
pages={59--66},
year={1998},
organization={IEEE}
}
@INPROCEEDINGS{shirdhonkar:cvpr2008,
author={Shirdhonkar, S. and Jacobs, D.W.},
booktitle={Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on},
title={Approximate earth mover's distance in linear time},
year={2008},
pages={1-8}
}
@inproceedings{schmitzer2013hierarchical,
title={A hierarchical approach to optimal transport},
author={Schmitzer, Bernhard and Schn{\"o}rr, Christoph},
booktitle={International Conference on Scale Space and Variational Methods in Computer Vision},
pages={452--464},
year={2013},
organization={Springer}
}
@article{schmitzer2015sparse,
title={A Sparse Multi-Scale Algorithm for Dense Optimal Transport},
author={Schmitzer, Bernhard},
journal={arXiv preprint arXiv:1510.05466},
year={2015}
}
@book{villani:book2009,
title={Optimal transport: old and new},
author={Villani, C{\'e}dric},
volume={338},
year={2009},
publisher={Springer}
}
###LP software
@misc{glpk,
author = {Makhorin, Andrew},
title = {{GLPK} ({GNU} Linear Programming Kit)},
howpublished = {http://www.gnu.org/software/glpk},
year = {2013}
}
@misc{cplex,
author = {IBM},
title = {Ilog Cplex},
howpublished = {http://www.ilog.com/products/cplex/},
year = {2013}
}
@misc{mosek,
author = {Erling D. Andersen and Knud D. Andersen},
title = {{The MOSEK optimization software}},
howpublished = {http://www.mosek.com/},
year = {2013}
}
@MISC{eigen,
author = {Ga\"{e}l Guennebaud and Beno\^{i}t Jacob and others},
title = {Eigen v3},
howpublished = {http://eigen.tuxfamily.org},
year = {2010}
}