On a dual network exterior point simplex type algorithm and its computational behavior
George Geranis, Konstantinos Paparrizos, Angelo Sifaleras (2012)
RAIRO - Operations Research
Similarity:
The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it ...