Indexed metadata

A polynomial time primal network simplex algorithm for minimum cost flows

James B. Orlin

Source record

Source: Crossref

Published: Aug 1, 1997

DOI: 10.1007/bf02614365

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

A polynomial time primal network simplex algorithm for minimum cost flows — Mathematical Frontier Network