Network flow problems with one side constraint: A comparison of three solution methods
From MaRDI portal
(Redirected from Publication:1102172)
Recommendations
Cites work
- scientific article; zbMATH DE number 3175708 (Why is no real title available?)
- scientific article; zbMATH DE number 3791941 (Why is no real title available?)
- scientific article; zbMATH DE number 2166303 (Why is no real title available?)
- A Lagrangean relaxation method for the constrained assignment problem
- A primal algorithm for solving a capacitated network flow problem with additional linear constraints
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
- Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
- Decomposition Principle for Linear Programs
- Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow 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
- Solution of constrained generalized transportation problems using the pivot and probe algorithm
- Solving Constrained Transportation Problems
- Solving embedded generalized network problems
- Solving singularly constrained generalized network problems
- The simplex SON algorithm for LP/embedded network problems
Cited in
(17)- A novel approach to subgraph selection with multiple weights on arcs
- 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
- A note on asymptotic formulae for one-dimensional network flow problems
- scientific article; zbMATH DE number 4085384 (Why is no real title available?)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- scientific article; zbMATH DE number 4143749 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 2084706 (Why is no real title available?)
- Numerical methods for basic solutions of generalized flow networks
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)