On dual minimum cost flow algorithms

DOI10.1007/s001860200202zbMath1023.90074OpenAlexW1974548385MaRDI QIDQ1396922

Jens Vygen

Publication date: 14 July 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860200202

zbMATH Keywords

dual algorithmsstrongly polynomial algorithmminimum cost flow problemcut cancellingdual network simplex

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (11)

Smoothed Analysis of the Successive Shortest Path Algorithm ⋮ Reverse selective obnoxious center location problems on tree graphs ⋮ Minimum-cost flow algorithms: an experimental evaluation ⋮ Robust Algorithms for TSP and Steiner Tree ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ The blocking job shop with rail-bound transportation ⋮ Geometric quadrisection in linear time, with application to VLSI placement ⋮ Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees ⋮ Efficient algorithms for the reverse shortest path problem on trees under the hamming distance ⋮ Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms ⋮ Problems of synthesis of connected networks with respect to isomorphic subgraphs

This page was built for publication: On dual minimum cost flow algorithms