Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"MCNFP"”.

  1. A dual network exterior point simplex-type algorithm for the minimum cost network flow problem

    The Minimum Cost Network Flow Problem (MCNFP) refers to a wide category of network flow problems and it is an important research area of Network Optimization. A Dual Network Exterior Point Simplex Algorithm (DNEPSA) for the MCNFP is presented here. The algorithm belongs to the special category of …

    greece Repository record for A dual network exterior point simplex-type algorithm for the minimum cost network flow problem (opens in a new tab)