Polynomial auction algorithms for shortest paths

Polynomial auction algorithms for shortest paths

Includes bibliographical references (p. 24-25).

Bibliographic Details
Other Authors:	Bertsekas, Dimitri P.
Language:	eng
Published:	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] 2003
Subjects:	TK7855.M41 E3845 no.2107
Online Access:	http://hdl.handle.net/1721.1/3264

Similar Items

An auction algorithm for shortest paths
Published: (2003)

Modified auction algorithms for shortest paths
Published: (2003)

Parallel shortest path auction algorithms
Published: (2003)

An auction/sequential shortest path algorithm for the minimum cost network flow problem
Published: (2003)

Communication complexity of distributed shortest path algorithms
Published: (2003)

An adaptive distributed Dijkstra shortest path algorithm
Published: (2003)

Efficient algorithms for continuous-space shortest path problems
Published: (2003)

A simple and fast label correcting algorithm for shortest paths
Published: (2003)

Forward path search : a new dual coordinate ascent algorithm for shortest paths
Published: (2003)

An analysis of stochastic shortest path problems
Published: (2003)

Stochastic shortest path problems with recourse
Published: (2003)

Parallel asynchronous label correcting methods for shortest paths
Published: (2003)

The auction algorithm for the transportation problem
Published: (2003)

An auction algorithm for the max-flow problem
Published: (2003)

Asymptotic optimality of shortest path routing
Published: (2003)

Stochastic shortest path games : theory and algorithms
by: Patek, Stephen D. (Stephen David)
Published: (2005)

The auction algorithm for assignment and other network flow problems
Published: (2003)

The auction algorithm for the minimum cost network flow problem
Published: (2003)

A distributed shortest path protocol
Published: (2002)

A forward/reverse auction algorithm for asymmetric assignment problems
Published: (2003)

Auction algorithms for network flow problems : a tutorial introduction
Published: (2003)

Auction algorithms for network flow problems : a tutorial introduction
Published: (2003)

The auction algorithm : a distributed relaxation method for the assignment problem
Published: (2003)

A generic auction algorithm for the minimum cost network flow problem
Published: (2003)

A very simple polynomial-time algorithm for linear programming
Published: (2003)

Polynomial time algorithms for finite horizon, stationary Markov decision processes
Published: (2003)

Mathematical equivalence of the auction algorithm for assignment and the e-relaxation (preflow-push) method for min cost flow
Published: (2003)

A simple polynomial-time algorithm for convex quadratic programming
Published: (2003)

E-relaxation and auction method for separable convex cost network flow problems
Published: (2003)

Nonuniform array processing via the polynomial approach
Published: (2003)

Expansions for determinants and for characteristic polynomials of stochastic matrices
Published: (2003)

A path-following algorithm for linear programming using quadratic and logarithmic penalty functions
Published: (2003)

A sufficient condition for the stability of interval matrix polynomials
Published: (2003)

Topology broadcast algorithms
Published: (2003)

The Lions-Mercier splitting algorithm and the alternating direction method are instances of the proximal point algorithm
Published: (2003)

Rollout algorithms for combinatorial optimization
Published: (2003)

Optimal communication algorithms for hypercubes
Published: (2003)

On the convergence of the affine-scaling algorithm
Published: (2003)

Convergence of the simulated annealing algorithm
Published: (2003)

The nonlinear proximal point algorithm
Published: (2003)