An efficient implementation of the network simplex method
From MaRDI portal
Publication:3725834
Cited in
(45)- A new strongly polynomial dual network simplex algorithm
- A network penalty method
- On the computational behavior of a polynomial-time network flow algorithm
- scientific article; zbMATH DE number 1054678 (Why is no real title available?)
- A least-squares minimum-cost network flow algorithm
- scientific article; zbMATH DE number 3869028 (Why is no real title available?)
- Minimum-cost flow algorithms: an experimental evaluation
- Numerical methods for basic solutions of generalized flow networks
- Parallel arc-allocation algorithms for optimizing generalized networks
- Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
- scientific article; zbMATH DE number 515927 (Why is no real title available?)
- \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
- Numerical solutions of the mass transfer problem
- A practical anti-degeneracy row selection technique in network linear programming
- On large scale nonlinear network optimization
- scientific article; zbMATH DE number 4174642 (Why is no real title available?)
- An exponential‐function reduction method for block‐angular convex programs
- An exterior simplex type algorithm for the minimum cost network flow problem
- A decentralized coordination mechanism for integrated production-transportation-inventory problem in the supply chain using Lagrangian relaxation
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem
- Solving a class of network models for dynamic flow control
- scientific article; zbMATH DE number 515933 (Why is no real title available?)
- Performance evaluation of independent superbasic sets on nonlinear replicated networks
- A generator and a simplex solver for network piecewise linear programs
- Finding non-dominated solutions in bi-objective integer network flow problems
- AN EFFICIENT COMPLETE ENUMERATION METHOD FOR NETWORK DESIGN PROBLEMS AND ITS APPLICATIONS
- scientific article; zbMATH DE number 515929 (Why is no real title available?)
- A Primal Simplex Approach to Pure Processing Networks
- The quickest flow problem
- Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
- A linear model for compound multicommodity network flow problems
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- An implementation of linear and nonlinear multicommodity network flows
- A primal-dual simplex algorithm for bi-objective network flow problems
- Infinite networks: Minimal cost flows
- A network simplex algorithm for solving the minimum distribution cost problem
- Design and Implementation of Data Structures for Generalized Networks
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- Network simplex algorithm for the general equal flow problem.
- On strongly polynomial dual simplex algorithms for the maximum flow problem
- A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals
- scientific article; zbMATH DE number 515932 (Why is no real title available?)
- scientific article; zbMATH DE number 1444279 (Why is no real title available?)
- Automatic decrease of the penalty parameter in exact penalty function methods
This page was built for publication: An efficient implementation of the network simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3725834)
