An experimental investigation of a primal-dual exterior point simplexalgorithm

DOI10.1080/02331934.2013.765422MaRDI QIDQ2868925zbMATH OpenOpenAlexFDO

Authors Themistoklis Glavelis, Nikolaos Samaras

Publication date 19 December 2013

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2013.765422

zbMATH Keywords

linear programmingcomputational resultssimplex algorithmexterior point algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Inventory, storage, reservoirs (90B05) Extreme-point and pivoting methods (90C49)

Recommendations

• An experimental study of bicriteria models for robust timetabling
• A bicriteria approach for robust timetabling
• Fast approaches to robust railway timetabling
• An empirical analysis of robustness concepts for timetabling
• Delay Management Problem: Complexity Results and Robust Algorithms

Cites work

• A new efficient primal dual simplex algorithm
• A new polynomial-time algorithm for linear programming
• A primal-dual exterior point algorithm for linear programming problems
• An efficient simplex type algorithm for sparse and dense linear programs.
• An infeasible (exterior point) simplex algorithm for assignment problems
• Combining Interior-Point and Pivoting Algorithms for Linear Programming
• Multiple centrality corrections in a primal-dual method for linear programming
• Pivot rules for linear programming: A survey on recent theoretical developments
• The Average number of pivot steps required by the Simplex-Method is polynomial

Cited in

(2)

• Improving a primal–dual simplex-type algorithm using interior point methods
• An experimental study of bicriteria models for robust timetabling

This page was built for publication: An experimental investigation of a primal-dual exterior point simplexalgorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868925)