A comprehensive simplex-like algorithm for network optimization and perturbation analysis
From MaRDI portal
Publication:4764598
DOI10.1080/02331939508844049zbMath0818.90122OpenAlexW2059639915MaRDI QIDQ4764598
No author found.
Publication date: 8 May 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939508844049
transportationshortest pathsensitivity analysisdegeneracyassignmentnetwork optimizationcritical pathtolerance analysisself-dual simplexmax flowLP perturbation analysis
Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)
Related Items (4)
A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs ⋮ A computationally stable solution algorithm for linear programs ⋮ An artificial-free simplex-type algorithm for general LP models ⋮ Linearly constrained global optimization: a general solution algorithm with applications.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New crash procedures for large systems of linear constraints
- Solving network manpower problems with side constraints
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
- A complete algorithm for linear fractional programs
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time
- Approaches to sensitivity analysis in linear programming
- Transmission facility planning in telecommunications networks: A heuristic approach
- An infeasible (exterior point) simplex algorithm for assignment problems
- A note on the continuity of solutions of parametric linear programs
- Reoptimization procedures for bounded variable primal simplex network algorithms
- Improving the Hungarian assignment algorithm
- A Lagrangean relaxation method for the constrained assignment problem
- A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
- Network flow problems with one side constraint: A comparison of three solution methods
- A dual approach to primal degeneracy
- Parametric linear programming and anti-cycling pivoting rules
- A network penalty method
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
- Expressing combinatorial optimization problems by linear programs
- On the computational behavior of a polynomial-time network flow algorithm
- New scaling algorithms for the assignment and minimum mean cycle problems
- Auction algorithms for network flow problems: A tutorial introduction
- Programming in networks and graphs. On the combinatorial background and near-equivalence of network flow and matching algorithms
- Multi-parametric analysis of the maximum tolerance in a linear programming problem
- A practical anti-cycling procedure for linearly constrained optimization
- A linear symbolic-based approach to matrix inversion
- The more-for-less paradox in linear programming
- A Fast and Simple Algorithm for the Maximum Flow Problem
- Solving Generalized Networks
- Contributions to the hungarian method
- Shortest-path algorithms: Taxonomy and annotation
- Sensitive and parametric analysis of the maximum flow in a network
- Some Recent Advances in Network Flows
- Anti-stalling pivot rules for the network simplex algorithm
- Faster algorithms for the shortest path problem
- Performance of Shortest Path Algorithms in Network Flow Problems
- On cycling in the network simplex method
- Technical Note—A Polynomial Simplex Method for the Assignment Problem
- Characterization of all optimal solutions and parametric maximal mows in networks
- Efficient dual simplex algorithms for the assignment problem
- Complexity of some parametric integer and network programming problems
- On the simplex algorithm for networks and generalized networks
- Algorithms for maximum network flow
- The Efficiency of the Simplex Method: A Survey
- Resource allocation on condition of random resource demand of network activities
- The tolerance approach to sensitivity analysis in network linear programming
- Dual Algorithms for Pure Network Problems
- A new approach to the maximum-flow problem
- Parametric maximal flows in generalized networks – complexity and algorithms
- Combinatorial Optimization with Rational Objective Functions
- A bump triangular dynamic factorization algorithm for the simplex method
- A practicable steepest-edge simplex algorithm
- Arc tolerances in shortest path and network flow problems
- Degeneracy and the More-For-Less Paradox
- Sensitivity analysis of optimal matchings
- Distributed computation on graphs
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- A simplex-like method with bisection for linear programming1
- Minimum flows in (s,t) planar networks
- The Scaling Network Simplex Algorithm
- Postoptimality Analyses of the Transportation Problem
- Implementing the Simplex Method: The Initial Basis
- An improved version of the out-of-kilter method and a comparative study of computer codes
- Solving Constrained Transportation Problems
- On Finding and Updating Spanning Trees and Shortest Paths
- The zero pivot phenomenon in transportation and assignment problems and its computational implications
- Cost operator algorithms for the transportation problem
- Deterministic network optimization: A bibliography
- On the Bartels—Golub decomposition for linear programming bases
- The alternating basis algorithm for assignment problems
- Testing of a large-scale network optimization program
- Theoretical Properties of the Network Simplex Method
- Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
- A Fourth bibliography of fractional programming
- Integrating network optimization capabilities into a high-level modeling language
- An improved primal simplex variant for pure processing networks
- Variants of the Hungarian method for solving linear programming problems
- Polynomial algorithms for a class of linear programs
- A bad network problem for the simplex method and other minimum cost flow algorithms
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- Efficient Shortest Path Simplex Algorithms
This page was built for publication: A comprehensive simplex-like algorithm for network optimization and perturbation analysis
