Fetching the paper…
Reading the bibliography…
A well-studied nonlinear extension of the minimum-cost flow problem is to minimize the objective $\sum_{ij\in E} C_{ij}(f_{ij})$ over feasible flows $f$, where on every arc $ij$ of the network, $C_{ij}$ is a convex function.
Consensus of subjective probabilities: The pari-mutuel method
E. Eisenberg and D. Gale · 1959
Earlier work this paper cites.
Algorithm 97: shortest path
R. Floyd · 1962
Earlier work this paper cites.
Theoretical improvements in algorithmic efficiency for network flow problems
J. Edmonds and R. M. Karp · 1972
Earlier work this paper cites.
Combinatorial optimization with rational objective functions
N. Megiddo · 1979
Earlier work this paper cites.
Applying parallel computation algorithms in the design of serial algorithms
N. Megiddo · 1983
Earlier work this paper cites.
Submodular systems and related topics
S. Fujishige · 1984
Earlier work this paper cites.
A polynomial algorithm for minimum quadratic cost flow problems
M. Minoux · 1984
Earlier work this paper cites.
Solving integer minimum cost flows with separable convex cost objective polynomially
M. Minoux · 1985
Earlier work this paper cites.
A strongly polynomial minimum cost circulation algorithm
É. Tardos · 1985
Earlier work this paper cites.
A strongly polynomial algorithm to solve combinatorial linear programs
É. Tardos · 1986
Earlier work this paper cites.
Fibonacci heaps and their uses in improved network optimization algorithms
M. L. Fredman and R. E. Tarjan · 1987
Earlier work this paper cites.
On the worst-case arithmetic complexity of approximating zeros of polynomials
J. Renegar · 1987
Earlier work this paper cites.
Matrix multiplication via arithmetic progressions
D. Coppersmith and S. Winograd · 1990
Earlier work this paper cites.
Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos’ algorithm
F. Granot and J. Skorin-Kapov · 1990
Earlier work this paper cites.
Convex separable optimization is not much harder than linear optimization
D. S. Hochbaum and J. G. Shanthikumar · 1990
Cited alongside, same era.
Network Flows: Theory, Algorithms, and Applications
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin · 1993
Cited alongside, same era.
Geometric Algorithms and Combinatorial Optimizations
M. Grötschel, L. Lovász, and A. Schrijver · 1993
Cited alongside, same era.
A faster strongly polynomial minimum cost flow algorithm
J. B. Orlin · 1993
Cited alongside, same era.
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on series-parallel networks
A. Tamir · 1993
Cited alongside, same era.
Strongly polynomial algorithms for the quadratic transportation problem with a fixed number of sources
S. Cosares and D. S. Hochbaum · 1994
Complexity and algorithms for nonlinear optimization problems
D. S. Hochbaum · 2007
Later among the works it cites.
On convex minimization over base polytopes
K. Nagano · 2007
Later among the works it cites.
Algorithmic Game Theory
N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani · 2007
Later among the works it cites.
Market equilibrium via a primal–dual algorithm for a convex program
N. R. Devanur, C. H. Papadimitriou, A. Saberi, and V. V. Vazirani · 2008
Later among the works it cites.
An algorithm for finding equilibrium in the linear exchange model with fixed budgets
V. I. Shmyrev · 2009
Later among the works it cites.
Eisenberg-Gale markets: Algorithms and game-theoretic properties
K. Jain and V. V. Vazirani · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Lower and upper bounds for the allocation problem and other nonlinear optimization problems
D. S. Hochbaum · 1994
Cited alongside, same era.
About strongly polynomial time algorithms for quadratic optimization over submodular constraints
D. Hochbaum and S. Hong · 1995
Cited alongside, same era.
A capacity scaling algorithm for convex cost submodular flows
S. Iwata · 1997
Cited alongside, same era.
Polynomial methods for separable convex optimization in unimodular linear spaces with applications
A. V. Karzanov and S. T. McCormick · 1997
Cited alongside, same era.
Theory of Linear and Integer Programming
A. Schrijver · 1998
Cited alongside, same era.
Minimizing a convex cost closure set
D. Hochbaum and M. Queyranne · 2003
Cited alongside, same era.
Improved algorithms for computing Fisher’s market clearing prices
J. B. Orlin · 2010
Later among the works it cites.
Spending constraint utilities with applications to the adwords market
V. V. Vazirani · 2010
Later among the works it cites.
Distributed algorithms via gradient descent for Fisher markets
B. Birnbaum, N. R. Devanur, and L. Xiao · 2011
Closest in time.
A perfect price discrimination market model with production, and a (rational) convex program for it
G. Goel and V. V. Vazirani · 2011
Closest in time.
The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game
V. V. Vazirani · 2012
Closest in time.
Concave generalized flows with applications to market equilibria
L. A. Végh · 2014
Closest in time.
Strongly polynomial algorithm for generalized flow maximization
L. A. Végh · 2014
Closest in time.