Implementation and test of auction methods for solving generalized network flow problems with separable convex cost

DOI10.1023/A:1019629113986zbMath1047.90073WikidataQ58921734 ScholiaQ58921734MaRDI QIDQ1810926

Paul Tseng, Francesca Guerriero

Publication date: 9 June 2003

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

implementationcomputation\(\varepsilon\)-relaxation methodauction sequential shortest path algorithmGeneralized network flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (2)

A proximal subgradient projection algorithm for linearly constrained strictly convex problems ⋮ A fast exact method for the capacitated facility location problem with differentiable convex production costs

Uses Software

• CPLEX
• PPRN
• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relaxation methods for monotropic programs
• Dual coordinate step methods for linear network flow problems
• An implementation of linear and nonlinear multicommodity network flows
• The partitioned \(\varepsilon\)-relaxation algorithm for separable convex network flow problems
• An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems
• Finding Minimum-Cost Circulations by Successive Approximation
• Nonlinear cost network models in transportation analysis
• OR Practice—Large-Scale Nonlinear Network Models and Their Application
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems
• An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems

This page was built for publication: Implementation and test of auction methods for solving generalized network flow problems with separable convex cost