An e-relaxation method for separable convex cost network flow problems

An e-relaxation method for separable convex cost network flow problems

Includes bibliographical references (p. 16-18).

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

Similar Items

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

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

Relaxation methods for problems with strictly convex separable costs and linear constraints
Published: (2003)

Relaxation methods for problems with strictly convex costs and linear inequality constraints
Published: (2003)

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

Distributed asynchronous relaxation methods for convex network flow problems
Published: (2002)

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

RELAX-IV : a faster version of the RELAX code for solving minimum cost flow problems
Published: (2003)

Relaxation methods for network flow problems with convex arc costs
Published: (2003)

RELAX: a computer code for minimum cost network flow problems
Published: (2003)

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

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

Relaxation methods for minimum cost network flow problems
Published: (2002)

Dual coordinate ascent for problems with strictly convex costs and linear constraints : a unified approach
Published: (2003)

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

The relaxation method for a special class of linear programming problems
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)

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

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

Relaxation methods for linear programs
Published: (2003)

Relaxation methods for monotropic programs
Published: (2003)

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

On the convergence of the exponential multiplier method for convex programming
Published: (2003)

On the convergence of the coordinate descent method for convex differentiable minimization
Published: (2003)

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

Relaxation method for linear programs with side constraints
Published: (2003)

Communication complexity of convex optimization
Published: (2003)

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

Relaxation method for large scale linear programming using decomposition
Published: (2003)

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

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

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

A value iteration method for the average cost dynamic programming problem
Published: (2003)

Partial proximal minimization algorithms for convex programming
Published: (2003)

A decomposition algorithm for convex differentiable minimization
Published: (2003)

Basis descent methods for convex essentially smooth optimization with applications to quadratic/entropy optimization and resource allocation
Published: (2003)

A note on error bounds for convex and nonconvex programs
Published: (2003)

A note on error bounds for convex and nonconvex programs
Published: (2003)

Reconstructing convex sets from support line measurements
Published: (2003)