On a Natural Dynamics for Linear Programming

A new polynomial-time algorithm for linear programming

N. Karmarkar · 1984

Earlier work this paper cites.

Theory of Linear and Integer Programming

Alexander Schrijver · 1986

Earlier work this paper cites.

The nonlinear geometry of linear programming. I. Affine and projective scaling trajectories

D. A. Bayer and J. C. Lagarias · 1989

Earlier work this paper cites.

Boundary behavior of interior point algorithms in linear programming

N. Megiddo and M. Shub · 1989

Earlier work this paper cites.

Riemannian geometry underlying interior point methods for linear programming

N. Karmarkar · 1990

Earlier work this paper cites.

Ii dikin’s convergence result for the affine-scaling algorithm

J.C. Lagarias and Vanderbei R.J · 1990

Earlier work this paper cites.

Linear Programming

Howard Karloff · 1991

Cited alongside, same era.

Primal-Dual Interior-Point Methods

S. Wright · 1997

Cited alongside, same era.

Maze-solving by an amoeboid organism

Toshiyuki Nakagaki, Hiroyasu Yamada, and Agota Toth · 2000

Cited alongside, same era.

Differential equations and dynamical systems

Lawrence Perko · 2001

Cited alongside, same era.

On the Riemannian geometry defined by self-concordant barriers and interior-point methods

Yu. Nesterov and M. Todd · 2002

Cited alongside, same era.

A mathematical model for adaptive transport network in path finding by true slime mold

Atsushi Tero, Ryo Kobayashi, and Toshiyuki Nakagaki · 2007

Cited alongside, same era.

Convergence Properties for the Physarum Solver

K. Ito, A. Johansson, T. Nakagaki, and A. Tero · 2011

Later among the works it cites.

Physarum can compute shortest paths

Vincenzo Bonifaci, Kurt Mehlhorn, and Girish Varma · 2012

Later among the works it cites.

A slime mold solver for linear programming problems

Anders Johannson and James Zou · 2012

Later among the works it cites.

Physarum can compute shortest paths: Convergence proofs and complexity bounds

Luca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, and Kurt Mehlhorn · 2013

Later among the works it cites.

Natural algorithms for flow problems

Damian Straszak and Nisheeth K. Vishnoi · 2016

Closest in time.