A fast polynomial time algorithm for logistics network flows
type: Item
instance of: scholarly article
title: A fast polynomial time algorithm for logistics network flows
zbMATH Open document ID: 1146.90013
author: Suh-Wen Chiou
published in: Applied Mathematics and Computation
publication date: 2008-05-16T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 5276000
zbMATH Keywords: multi-tiered logistics network
zbMATH Keywords: combinatorial approximation algorithm
zbMATH Keywords: minimum-cost flow
zbMATH Keywords: global convergence
zbMATH Keywords: minimum congestion
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.amc.2007.09.039
OpenAlex ID: W2066191036
cites work: Using separation algorithms in fixed dimension
cites work: The maximum concurrent flow problem
cites work: Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
cites work: Fast approximation algorithms for multicommodity flow problems
cites work: Fast deterministic approximation for the multicommodity flow problem
cites work: Q4283452
cites work: Q3840370
cites work: Convergence Conditions for Nonlinear Programming Algorithms
DOI: 10.1016/J.AMC.2007.09.039
description: scientific article; zbMATH DE number 5276000