A comprehensive simplex-like algorithm for network optimization and perturbation analysis
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4018762 (Why is no real title available?)
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3852305 (Why is no real title available?)
- scientific article; zbMATH DE number 3876469 (Why is no real title available?)
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 4049374 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3791941 (Why is no real title available?)
- scientific article; zbMATH DE number 53116 (Why is no real title available?)
- scientific article; zbMATH DE number 3561035 (Why is no real title available?)
- scientific article; zbMATH DE number 741202 (Why is no real title available?)
- scientific article; zbMATH DE number 3283574 (Why is no real title available?)
- A Fast and Simple Algorithm for the Maximum Flow Problem
- A Fourth bibliography of fractional programming
- A Lagrangean relaxation method for the constrained assignment problem
- A bad network problem for the simplex method and other minimum cost flow algorithms
- A bump triangular dynamic factorization algorithm for the simplex method
- A complete algorithm for linear fractional programs
- A dual approach to primal degeneracy
- A linear symbolic-based approach to matrix inversion
- A network penalty method
- A new approach to the maximum-flow problem
- A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
- A note on the continuity of solutions of parametric linear programs
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
- A practicable steepest-edge simplex algorithm
- A practical anti-cycling procedure for linearly constrained optimization
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n^ 2m) time
- A simplex-like method with bisection for linear programming1
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
- Algorithms for maximum network flow
- An improved primal simplex variant for pure processing networks
- An improved version of the out-of-kilter method and a comparative study of computer codes
- An infeasible (exterior point) simplex algorithm for assignment problems
- Anti-stalling pivot rules for the network simplex algorithm
- Approaches to sensitivity analysis in linear programming
- Arc tolerances in shortest path and network flow problems
- Auction algorithms for network flow problems: A tutorial introduction
- Characterization of all optimal solutions and parametric maximal mows in networks
- Combinatorial Optimization with Rational Objective Functions
- Complexity of some parametric integer and network programming problems
- Contributions to the hungarian method
- Cost operator algorithms for the transportation problem
- Degeneracy and the More-For-Less Paradox
- Deterministic network optimization: A bibliography
- Distributed computation on graphs
- Dual Algorithms for Pure Network Problems
- Efficient Shortest Path Simplex Algorithms
- Efficient dual simplex algorithms for the assignment problem
- Expressing combinatorial optimization problems by linear programs
- Faster algorithms for the shortest path problem
- Implementing the Simplex Method: The Initial Basis
- Improving the Hungarian assignment algorithm
- Integrating network optimization capabilities into a high-level modeling language
- Minimum flows in (s,t) planar networks
- Multi-parametric analysis of the maximum tolerance in a linear programming problem
- Network flow problems with one side constraint: A comparison of three solution methods
- Network flows. Theory, algorithms, and applications.
- New crash procedures for large systems of linear constraints
- New scaling algorithms for the assignment and minimum mean cycle problems
- On Finding and Updating Spanning Trees and Shortest Paths
- On cycling in the network simplex method
- On the Bartels—Golub decomposition for linear programming bases
- On the computational behavior of a polynomial-time network flow algorithm
- On the simplex algorithm for networks and generalized networks
- Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
- Parametric linear programming and anti-cycling pivoting rules
- Parametric maximal flows in generalized networks – complexity and algorithms
- Performance of Shortest Path Algorithms in Network Flow Problems
- Polynomial algorithms for a class of linear programs
- Postoptimality Analyses of the Transportation Problem
- Programming in networks and graphs. On the combinatorial background and near-equivalence of network flow and matching algorithms
- Reoptimization procedures for bounded variable primal simplex network algorithms
- Resource allocation on condition of random resource demand of network activities
- Sensitive and parametric analysis of the maximum flow in a network
- Sensitivity analysis of optimal matchings
- Shortest-path algorithms: Taxonomy and annotation
- Solving Constrained Transportation Problems
- Solving Generalized Networks
- Solving network manpower problems with side constraints
- Some Recent Advances in Network Flows
- Technical Note—A Polynomial Simplex Method for the Assignment Problem
- Testing of a large-scale network optimization program
- The Efficiency of the Simplex Method: A Survey
- The Scaling Network Simplex Algorithm
- The alternating basis algorithm for assignment problems
- The more-for-less paradox in linear programming
- The tolerance approach to sensitivity analysis in network linear programming
- The zero pivot phenomenon in transportation and assignment problems and its computational implications
- Theoretical Properties of the Network Simplex Method
- Transmission facility planning in telecommunications networks: A heuristic approach
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- Variants of the Hungarian method for solving linear programming problems
Cited in
(11)- Linearly constrained global optimization: a general solution algorithm with applications.
- scientific article; zbMATH DE number 3959083 (Why is no real title available?)
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
- scientific article; zbMATH DE number 1472107 (Why is no real title available?)
- A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
- scientific article; zbMATH DE number 562250 (Why is no real title available?)
- scientific article; zbMATH DE number 1054678 (Why is no real title available?)
- An artificial-free simplex-type algorithm for general LP models
- Postoptimality Analyses of the Transportation Problem
- Reoptimization procedures for bounded variable primal simplex network algorithms
- A computationally stable solution algorithm for linear programs
This page was built for publication: A comprehensive simplex-like algorithm for network optimization and perturbation analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764598)
