Article ID: | iaor20127606 |
Volume: | 46 |
Issue: | 3 |
Start Page Number: | 211 |
End Page Number: | 234 |
Publication Date: | Jul 2012 |
Journal: | RAIRO - Operations Research |
Authors: | Paparrizos Konstantinos, Geranis George, Sifaleras Angelo |
Keywords: | combinatorial optimization, heuristics |
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 produces a solution that is both primal and dual feasible,