Network flow problems with one side constraint: A comparison of three solution methods
DOI10.1016/0305-0548(88)90022-6zbMATH Open0643.90023OpenAlexW2076840393MaRDI QIDQ1102172FDOQ1102172
Authors: 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
Recommendations
minimum cost network flowprimal simplex algorithmLagrangean approachrelaxation of the side constraint
Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)
Cites Work
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Title not available (Why is that?)
- Decomposition Principle for Linear Programs
- Title not available (Why is that?)
- A Lagrangean relaxation method for the constrained assignment problem
- Title not available (Why is that?)
- Solving Constrained Transportation Problems
- Solving embedded generalized network problems
- Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
- The simplex SON algorithm for LP/embedded network problems
- A primal algorithm for solving a capacitated network flow problem with additional linear constraints
- 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
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
- Solving singularly constrained generalized network problems
- Solution of constrained generalized transportation problems using the pivot and probe algorithm
- Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently
- Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
Cited In (17)
- Modeling the satellite placement problem as a network flow problem with one side constraint
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
- The equal flow problem
- A hybrid algorithm for solving network flow problems with side constraints.
- A specialized network simplex algorithm for the constrained maximum flow problem
- Title not available (Why is that?)
- A note on asymptotic formulae for one-dimensional network flow problems
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- Title not available (Why is that?)
- Applications of the parametric programming procedure
- On the equivalence of constrained and unconstrained flows
- Performance evaluation of independent superbasic sets on nonlinear replicated networks
- The Solution of Multiperiod Network Models with Bundle Constraints by Aggregation
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Title not available (Why is that?)
- Numerical methods for basic solutions of generalized flow networks
- A novel approach to subgraph selection with multiple weights on arcs
Uses Software
This page was built for publication: Network flow problems with one side constraint: A comparison of three solution methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102172)
