scientific article; zbMATH DE number 4174642
From MaRDI portal
Publication:3199176
Recommendations
Cited in
(49)- Reoptimization procedures for bounded variable primal simplex network algorithms
- Network flow problems with one side constraint: A comparison of three solution methods
- A network penalty method
- On the computational behavior of a polynomial-time network flow algorithm
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem
- A practical anti-degeneracy row selection technique in network linear programming
- An incremental primal-dual method for generalized networks
- Applying steepest-edge techniques to a network primal-dual algorithm
- Network simplex algorithm for the general equal flow problem.
- The simplex algorithm for multicommodity networks
- Balanced network flows. VII: Primal-dual algorithms.
- Minimum cost problem of assembly network flows
- Numerical methods for basic solutions of generalized flow networks
- A primal simplex variant for the maximum-flow problem
- A note on specialized versus unspecialized methods for maximum-flow problems
- A Network-Flow Algorithm for Project Selection
- scientific article; zbMATH DE number 3876888 (Why is no real title available?)
- Performance of Shortest Path Algorithms in Network Flow Problems
- scientific article; zbMATH DE number 4156166 (Why is no real title available?)
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- scientific article; zbMATH DE number 3896659 (Why is no real title available?)
- A unified framework for primal-dual methods in minimum cost network flow problems
- Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
- An efficient implementation of the network simplex method
- A forward network simplex algorithm for solving multiperiod network flow problems
- Design and Implementation of Data Structures for Generalized Networks
- A Primal Simplex Approach to Pure Processing Networks
- An efficient algorithm for the transshipment along a single road problem
- Dual Algorithms for Pure Network Problems
- Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
- scientific article; zbMATH DE number 515932 (Why is no real title available?)
- scientific article; zbMATH DE number 556046 (Why is no real title available?)
- scientific article; zbMATH DE number 1003246 (Why is no real title available?)
- scientific article; zbMATH DE number 1086915 (Why is no real title available?)
- scientific article; zbMATH DE number 1766755 (Why is no real title available?)
- A hypergraph network simplex algorithm
- An improved primal simplex variant for pure processing networks
- scientific article; zbMATH DE number 795215 (Why is no real title available?)
- scientific article; zbMATH DE number 870979 (Why is no real title available?)
- scientific article; zbMATH DE number 1444279 (Why is no real title available?)
- A specialized network simplex algorithm for the constrained maximum flow problem
- A simple method for improving the primal simplex method for the multicommodity flow problem
- A least-squares minimum-cost network flow algorithm
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
- The practical conversion of linear programmes to network flow models
- A comparison of pivot selection rules for primal simplex based network codes
- A computational comparison of the network simplex method with the dual affine scaling method
- The basis suppression method
- An exterior simplex type algorithm for the minimum cost network flow problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3199176)
