Currently displaying 1 – 4 of 4

Showing per page

Order by Relevance | Title | Year of publication

On a dual network exterior point simplex type algorithm and its computational behavior

George GeranisKonstantinos PaparrizosAngelo Sifaleras — 2012

RAIRO - Operations Research - Recherche Opérationnelle

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, it...

On a dual network exterior point simplex type algorithm and its computational behavior

George GeranisKonstantinos PaparrizosAngelo Sifaleras — 2012

RAIRO - Operations Research

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...

Page 1

Download Results (CSV)