Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem by James B. Orlin cover

Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem

by James B. Orlin

Genre: ai

Description

Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem by James B. Orlin. Read online or download for free.