A fast polynomial time algorithm for logistics network flows

DOI10.1016/J.AMC.2007.09.039MaRDI QIDQ924394zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A polynomial time primal network simplex algorithm for minimum cost flows
• A combinatorial approximation algorithm for supply chain network flow problem
• Strongly polynomial time algorithms for certain concave minimization problems on networks
• A polynomial algorithm for minimum quadratic cost flow problems
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm

Cites work

• scientific article; zbMATH DE number 1187163 (Why is no real title available?)
• scientific article; zbMATH DE number 515936 (Why is no real title available?)
• Convergence Conditions for Nonlinear Programming Algorithms
• Fast approximation algorithms for multicommodity flow problems
• Fast deterministic approximation for the multicommodity flow problem
• Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
• The maximum concurrent flow problem
• Using separation algorithms in fixed dimension

Cited in

(8)

• A bi-level programming for logistics network design with system-optimized flows
• A Recursive Algorithm for Order Cycle-time that Minimizes Logistics Cost
• A bio-inspired algorithm for identification of critical components in the transportation networks
• A combinatorial approximation algorithm for supply chain network flow problem
• scientific article; zbMATH DE number 5863215 (Why is no real title available?)
• Two-stage flow distribution model based on multi-objective optimization
• The binary network flow problem is logspace complete for P
• Optimal distributions for multiplex logistic networks

Describes a project that uses

Uses Software

• CPLEX

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q924394)