scientific article; zbMATH DE number 1187163

MaRDI QIDQ3840370zbMATH OpenFDO

Authors Andrew V. Goldberg, Jeffrey D. Oldham, Serge Plotkin, Clifford Stein

Publication date 10 August 1998

zbMATH Keywords

approximation algorithmsminimum-cost multicommodity flow problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 515936
• Fast approximation algorithms for multicommodity flow problems
• Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time

Cited in

(24)

• Hypermatrix oriented supernode amalgamation
• On some difficult linear programs coming from set partitioning
• Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
• A penalty function heuristic for the resource constrained shortest path problem
• A multicommodity network flow application for the capacitated minimal spanning tree problem
• Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
• A computational study of cost reoptimization for min-cost flow problems
• On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths
• A composite algorithm for a concave-cost network flow problem
• scientific article; zbMATH DE number 515936 (Why is no real title available?)
• A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
• Computing and Combinatorics
• scientific article; zbMATH DE number 910907 (Why is no real title available?)
• Multicommodity network flows: A survey. II: Solution methods
• Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
• A minimum cost algorithm for multicommodity flow traffic networks which have same convey cost
• Solving Multicommodity Flow Problems by an Approximation Scheme
• Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
• Approximation and Online Algorithms
• A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
• A combinatorial approximation algorithm for concurrent flow problem and its application
• A combinatorial approximation algorithm for supply chain network flow problem
• New methods for multi-commodity flows
• A fast polynomial time algorithm for logistics network flows

Describes a project that uses

Uses Software

• MINOS
• CPLEX
• PPRN

This page was built for publication:

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