Name
Abstract | ||
|---|---|---|
We consider the problem of finding the point in the transportation polytope which is closest to the origin. Recursive formulas to solve it are provided, explaining how they arise from geometric considerations, via projections, and we derive solution algorithms with linear computational complexity in the number of variables. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.dam.2015.01.027 | Discrete Applied Mathematics |
Keywords | Field | DocType |
quadratic optimization,inverse problem,orthogonal projection,karush kuhn tucker conditions | Combinatorics,Orthographic projection,Closest point,Polytope,Inverse problem,Quadratic programming,Karush–Kuhn–Tucker conditions,Mathematics,Recursion,Computational complexity theory | Journal |
Volume | Issue | ISSN |
210 | C | 0166-218X |
Citations | PageRank | References |
1 | 0.38 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| gilberto calvillo | 1 | 1 | 0.38 |
| David Romero | 2 | 22 | 3.65 |