Computational experience with exterior point algorithms for the transportation problem

DOI10.1016/j.amc.2003.09.028zbMath1062.65064OpenAlexW1978318240MaRDI QIDQ702553

Konstantinos Paparrizos, Nikolaos Samaras, Charalampos Papamanthou

Publication date: 17 January 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2003.09.028

zbMATH Keywords

comparison of methodsnumerical examplesTransportation problemAlgorithm evaluationcomputational performanceExperimental computational studyExterior point simplex algorithmsNetwork simplex algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Complexity and performance of numerical algorithms (65Y20)

Related Items

On the initialization methods of an exterior point algorithm for the assignment problem, Exterior point simplex-type algorithms for linear and network optimization problems, Computational experience with exterior point algorithms for the transportation problem

Uses Software

• MarPlex

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial dual network simplex algorithms
• Computational experience with exterior point algorithms for the transportation problem
• An infeasible (exterior point) simplex algorithm for assignment problems
• An exterior point simplex algorithm for (general) linear programming problems
• A decision support system for a real vehicle routing problem.
• The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems
• A Simplex-Type Algorithm for General Transportation Problems: An Alternative to Stepping-Stone
• A network simplex method
• The alternating basis algorithm for assignment problems
• An Investigation of Interior-Point Algorithms for the Linear Transportation Problem