Computational experience with exterior point algorithms for the transportation problem
type: Item
instance of: scholarly article
title: Computational experience with exterior point algorithms for the transportation problem
zbMATH Open document ID: 1062.65064
author: Charalampos Papamanthou
author: Konstantinos Paparrizos
author: Nikolaos Samaras
published in: Applied Mathematics and Computation
publication date: 2005-01-17T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 2128773
zbMATH Keywords: Transportation problem
zbMATH Keywords: Network simplex algorithm
zbMATH Keywords: Exterior point simplex algorithms
zbMATH Keywords: Algorithm evaluation
zbMATH Keywords: Experimental computational study
zbMATH Keywords: comparison of methods
zbMATH Keywords: numerical examples
zbMATH Keywords: computational performance
describes a project that uses: MarPlex
MaRDI profile type: Publication
full work available at URL: j.amc.2003.09.028
OpenAlex ID: W1978318240
cites work: Q3974955
cites work: Q4550760
cites work: Q3056948
cites work: A Simplex-Type Algorithm for General Transportation Problems: An Alternative to Stepping-Stone
cites work: The alternating basis algorithm for assignment problems
cites work: The stepping stone method of explaining linear programming calculations in transportation problems
cites work: A network simplex method
cites work: Q5808754
cites work: Polynomial dual network simplex algorithms
cites work: An exterior point simplex algorithm for (general) linear programming problems
cites work: An infeasible (exterior point) simplex algorithm for assignment problems
cites work: An Investigation of Interior-Point Algorithms for the Linear Transportation Problem
cites work: A decision support system for a real vehicle routing problem.
DOI: 10.1016/J.AMC.2003.09.028
description: scientific article; zbMATH DE number 2128773