The auction algorithm for assignment and other network flow problems

The auction algorithm for assignment and other network flow problems

Cover title.

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.1908
Online Access:	http://hdl.handle.net/1721.1/3154

Similar Items

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

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

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

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

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

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

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

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

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

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

Partially asynchronous, parallel algorithms for network flow and other problems
Published: (2003)

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

An auction algorithm for shortest paths
Published: (2003)

Modified auction algorithms for shortest paths
Published: (2003)

Parallel shortest path auction algorithms
Published: (2003)

Polynomial auction algorithms for shortest paths
Published: (2003)

The dynamic weapon-target assignment problem
Published: (2003)

Parallel asynchronous Hungarian methods for the assignment problem
Published: (2003)

Dynamic weapon-target assignment problems with vulnerable C2Ì³ nodes
Published: (2003)

New distance-directed algorithms for maximum flow and parametric maximum flow problems
Published: (2003)

Average waiting time assignment.
Published: (2003)

Average waiting time assignment.
Published: (2003)

Dual coordinate ascent methods for linear network flow problems
Published: (2003)

Distributed asynchronous relaxation methods for linear network flow problems
Published: (2003)

Relaxation methods for minimum cost ordinary and generalized network flow problems
Published: (2003)

An e-relaxation method for separable convex cost network flow problems
Published: (2003)

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

Finding maximal benefit/maximal cardinality assignments
Published: (2003)

A note on the genericity of simultaneous stabilizability and pole assignability
Published: (2002)

Rollout algorithms for stochastic scheduling problems
Published: (2003)

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

Application of the EM algorithm for the multitarget/multisensor tracking problem
Published: (2003)

Parallel primal-dual methods for the minimum cost flow problem
Published: (2003)

On the convergence of a matrix splitting algorithm for the symmetric linear complementarity problem
Published: (2003)

A note on the greedy approximation algorithm for the unweighted set covering problem
Published: (2003)

Parallel asynchronous primal-dual methods for the minimum cost flow problem
Published: (2003)

One-way multigrid algorithms and their optimality for a class of fixed-point problems
Published: (2003)

Universal computation and other capabilities of hybrid and continuous dynamical systems
Published: (2003)

Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem
Published: (2003)

A unified framework for primal-dual methods in minimum cost network flow problems
Published: (2003)