Network flow problems with one side constraint: A comparison of three solution methods

DOI10.1016/0305-0548(88)90022-6zbMath0643.90023OpenAlexW2076840393MaRDI QIDQ1102172

B. George

Publication date: 1988

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(88)90022-6

zbMATH Keywords

primal simplex algorithmminimum cost network flowLagrangean approachrelaxation of the side constraint

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Related Items (10)

On the equivalence of constrained and unconstrained flows ⋮ A novel approach to subgraph selection with multiple weights on arcs ⋮ A hybrid algorithm for solving network flow problems with side constraints. ⋮ Applications of the parametric programming procedure ⋮ An improved branch and bound algorithm for minimum concave cost network flow problems ⋮ A specialized network simplex algorithm for the constrained maximum flow problem ⋮ A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses ⋮ Modeling the satellite placement problem as a network flow problem with one side constraint ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis ⋮ Performance evaluation of independent superbasic sets on nonlinear replicated networks

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving embedded generalized network problems
• A Lagrangean relaxation method for the constrained assignment problem
• Solving singularly constrained generalized network problems
• Solution of constrained generalized transportation problems using the pivot and probe algorithm
• Decomposition Principle for Linear Programs
• Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
• The simplex SON algorithm for LP/embedded network problems
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently
• Solving Constrained Transportation Problems
• Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
• A primal algorithm for solving a capacitated network flow problem with additional linear constraints
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems

This page was built for publication: Network flow problems with one side constraint: A comparison of three solution methods