Exterior point simplex-type algorithms for linear and network optimization problems
From MaRDI portal
Publication:492840
DOI10.1007/s10479-014-1769-1zbMath1318.90062OpenAlexW2076410055WikidataQ57780875 ScholiaQ57780875MaRDI QIDQ492840
Nikolaos Samaras, Konstantinos Paparrizos, Angelo Sifaleras
Publication date: 21 August 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1769-1
Numerical mathematical programming methods (65K05) Linear programming (90C05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items
Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems, Improving a primal–dual simplex-type algorithm using interior point methods, A space decomposition-based deterministic algorithm for solving linear optimization problems
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
- A genuinely polynomial primal simplex algorithm for the assignment problem
- Exterior point algorithms for nearest points and convex quadratic programs
- A primal-dual simplex method for linear programs
- Polynomial dual network simplex algorithms
- Computational experience with exterior point algorithms for the transportation problem
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time
- A new polynomial-time algorithm for linear programming
- A feasible direction method for linear programming
- An infeasible (exterior point) simplex algorithm for assignment problems
- Efficient GPU-based implementations of simplex type algorithms
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
- Worst case examples of an exterior point algorithm for the assignment problem
- An exterior simplex type algorithm for the minimum cost network flow problem
- The complex interior-boundary method for linear and nonlinear programming with linear constraints
- On the finiteness of the criss-cross method
- The generalized simplex method
- The linear complementarity problem, sufficient matrices, and the criss- cross method
- Pivot rules for linear programming: A survey on recent theoretical developments
- An exterior point simplex algorithm for (general) linear programming problems
- The simplex algorithm with a new primal and dual pivot rule
- Criss-cross methods: A fresh view on pivot algorithms
- A polynomial time primal network simplex algorithm for minimum cost flows
- A new strongly polynomial dual network simplex algorithm
- EP theorems and linear complementarity problems
- On dual minimum cost flow algorithms
- Pivot versus interior point methods: Pros and cons
- New variants of finite criss-cross pivot algorithms for linear programming
- The finite criss-cross method for hyperbolic programming
- An efficient simplex type algorithm for sparse and dense linear programs.
- A relaxation column signature method for assignment problems
- Computational techniques of the simplex method
- A new efficient primal dual simplex algorithm
- New variants of the criss-cross method for linearly constrained convex quadratic programming
- You want them to remember? Then make it memorable! Means for enhancing operations research education
- The \(s\)-monotone index selection rules for pivot algorithms of linear programming
- A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
- A simple direct cosine simplex algorithm
- A largest-distance pivot rule for the simplex algorithm
- A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
- An exterior-point method for linear programming problems
- A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method
- The role of pivoting in proving some fundamental theorems of linear algebra
- The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems
- A Fast Algorithm for Linear Programming
- The Criss-Cross Method for Solving Linear Programming Problems
- On a dual network exterior point simplex type algorithm and its computational behavior
- The Simplex Method for Quadratic Programming
- Three nearly scaling-invariant versions of an exterior point algorithm for linear programming
- Assignment Problems
- A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides’ primal-dual simplex-type algorithm†
- A primal-dual exterior point algorithm for linear programming problems
- A dual exterior point simplex type algorithm for the minimum cost network flow problem
- Technical Note—A Polynomial Simplex Method for the Assignment Problem
- Efficient dual simplex algorithms for the assignment problem
- A convergent criss-cross method
- Signature Methods for the Assignment Problem
- Threshold assignment algorithm
- A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
- A Simplex-Type Algorithm for General Transportation Problems: An Alternative to Stepping-Stone
- The Average number of pivot steps required by the Simplex-Method is polynomial
- Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
- The Scaling Network Simplex Algorithm
- TSPLIB—A Traveling Salesman Problem Library
- An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks
- New Finite Pivoting Rules for the Simplex Method
- A Monotonic Build-Up Simplex Algorithm for Linear Programming
- Some generalizations of the criss-cross method for quadratic programming
- A new proof for the criss-cross method for quadratic programming
- A non improving simplex algorithm for transportation problems
- An Investigation of Interior-Point Algorithms for the Linear Transportation Problem
- A parametric visualization software for the assignment problem
- The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems
- Efficient Shortest Path Simplex Algorithms
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Minimum cost network flows: Problems, algorithms, and software
- On strongly polynomial variants of the MBU-simplex algorithm for a maximum flow problem with non-zero lower bounds
- Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules
- Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems
- New criss-cross type algorithms for linear complementarity problems with sufficient matrices
- Letters to the Editor—Extension of Dantzig's Algorithm to Finding an Initial Near-Optimal Basis for the Transportation Problem
- Basic Dual Feasible Solutions for a Class of Generalized Networks
- Some Empirical Tests of the Criss-Cross Method
- On the initialization methods of an exterior point algorithm for the assignment problem
- Programming of Interdependent Activities: II Mathematical Model
- On using exterior penalty approaches for solving linear programming problems
