An ε-Relaxation method for generalized separable convex cost network flow problems

DOI10.1007/3-540-61310-2_7zbMath1415.90140OpenAlexW2066446275MaRDI QIDQ4645915

Dimitri P. Bertsekas, Paul Tseng

Publication date: 11 January 2019

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61310-2_7

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Uses Software

• RELAX4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relaxation methods for monotropic programs
• New algorithms for generalized network flows
• Faster Algorithms for the Generalized Network Flow Problem
• Combinatorial Algorithms for the Generalized Circulation Problem
• Relaxation Methods for Network Flow Problems with Convex Arc Costs
• Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
• New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
• A Strongly Polynomial Algorithm for a Special Class of Linear Programs
• An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems

This page was built for publication: An ε-Relaxation method for generalized separable convex cost network flow problems