An efficient implementation of the network simplex method
DOI10.1007/BFB0121089zbMATH Open0594.90025MaRDI QIDQ3725834FDOQ3725834
Authors: M. D. Grigoriadis 
Publication date: 1986
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Recommendations
efficient implementationcomputational experiencenetwork simplex methodgradual penalty methodlarge sparse minimum- cost network flowsample pricing strategy
Numerical mathematical programming methods (65K05) Linear programming (90C05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cited In (45)
- Title not available (Why is that?)
- Infinite networks: Minimal cost flows
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
- AN EFFICIENT COMPLETE ENUMERATION METHOD FOR NETWORK DESIGN PROBLEMS AND ITS APPLICATIONS
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- Minimum-cost flow algorithms: an experimental evaluation
- Design and Implementation of Data Structures for Generalized Networks
- On large scale nonlinear network optimization
- A practical anti-degeneracy row selection technique in network linear programming
- A generator and a simplex solver for network piecewise linear programs
- A network penalty method
- An implementation of linear and nonlinear multicommodity network flows
- A Primal Simplex Approach to Pure Processing Networks
- A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals
- Solving a class of network models for dynamic flow control
- Network simplex algorithm for the general equal flow problem.
- Title not available (Why is that?)
- An exponential‐function reduction method for block‐angular convex programs
- Title not available (Why is that?)
- A linear model for compound multicommodity network flow problems
- A network simplex algorithm for solving the minimum distribution cost problem
- On the computational behavior of a polynomial-time network flow algorithm
- Finding non-dominated solutions in bi-objective integer network flow problems
- A primal-dual simplex algorithm for bi-objective network flow problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A decentralized coordination mechanism for integrated production-transportation-inventory problem in the supply chain using Lagrangian relaxation
- On strongly polynomial dual simplex algorithms for the maximum flow problem
- Title not available (Why is that?)
- Performance evaluation of independent superbasic sets on nonlinear replicated networks
- Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
- Automatic decrease of the penalty parameter in exact penalty function methods
- A least-squares minimum-cost network flow algorithm
- Parallel arc-allocation algorithms for optimizing generalized networks
- Numerical solutions of the mass transfer problem
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem
- Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
- \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
- An exterior simplex type algorithm for the minimum cost network flow problem
- Title not available (Why is that?)
- A new strongly polynomial dual network simplex algorithm
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- Numerical methods for basic solutions of generalized flow networks
- Title not available (Why is that?)
- The quickest flow problem
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)
