Dual Algorithms for Pure Network Problems

DOI10.1287/OPRE.37.1.159MaRDI QIDQ3812008zbMATH OpenOpenAlexFDO

Authors Agha Iqbal Ali, Rema Padman, Hemalatha Thiagarajan

Publication date 1989

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.37.1.159

zbMATH Keywords

assignment problemscapacitated minimum cost network flow problemComputational testingcut-setsdual algorithmdual reoptimizationimplementationtransportation problemstransshipment problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Large-scale problems in mathematical programming (90C06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• On dual minimum cost flow algorithms (extended abstract)
• On dual minimum cost flow algorithms
• scientific article; zbMATH DE number 4174642
• scientific article; zbMATH DE number 5173820
• A unified framework for primal-dual methods in minimum cost network flow problems

Cited in

(18)

• Reoptimization procedures for bounded variable primal simplex network algorithms
• A dual algorithm for submodular flow problems
• Algorithms for network piecewise-linear programs: A comparative study
• A new strongly polynomial dual network simplex algorithm
• A new dual based procedure for the transportation problem
• Optimization of primal and dual network models of distribution
• Simultaneous lotsizing and scheduling on parallel machines
• Obtaining a good primal solution to the uncapacitated transportation problem
• Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
• Early-tardy cost trade-offs in resource constrained projects with cash flows: An optimization-guided heuristic approach
• scientific article; zbMATH DE number 60122 (Why is no real title available?)
• The quickest flow problem
• scientific article; zbMATH DE number 1054678 (Why is no real title available?)
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• Updating network flows given multiple, heterogeneous arc attribute changes
• Dual-based approximation algorithms for cut-based network connectivity problems
• Knowledge integration using problem spaces: A study in resource-constrained project scheduling
• A survey of dynamic network flows

Describes a project that uses

Uses Software

• NETGEN

This page was built for publication: Dual Algorithms for Pure Network Problems

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