A combinatorial approximation algorithm for supply chain network flow problem

DOI10.1016/j.amc.2006.07.144zbMath1123.65055OpenAlexW1966144567MaRDI QIDQ884620

Suh-Wen Chiou

Publication date: 6 June 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.07.144

zbMATH Keywords

numerical examplessimplicial decompositionminimum-cost flowcombinatorial approximation algorithmsupply chain network flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

Cites Work

• Fast deterministic approximation for the multicommodity flow problem
• Fast approximation algorithms for multicommodity flow problems
• The maximum concurrent flow problem
• Simplicial decomposition in nonlinear programming algorithms
• An extension of the frank and Wolfe method of feasible directions
• Convergence Conditions for Nonlinear Programming Algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: A combinatorial approximation algorithm for supply chain network flow problem