A fast polynomial time algorithm for logistics network flows

DOI10.1016/j.amc.2007.09.039zbMath1146.90013OpenAlexW2066191036MaRDI QIDQ924394

Suh-Wen Chiou

Publication date: 16 May 2008

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

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

zbMATH Keywords

global convergenceminimum congestionminimum-cost flowcombinatorial approximation algorithmmulti-tiered logistics network

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (1)

A bio-inspired algorithm for identification of critical components in the transportation networks

Uses Software

• CPLEX

Cites Work

• Fast deterministic approximation for the multicommodity flow problem
• Fast approximation algorithms for multicommodity flow problems
• The maximum concurrent flow problem
• Using separation algorithms in fixed dimension
• Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
• Convergence Conditions for Nonlinear Programming Algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: A fast polynomial time algorithm for logistics network flows