A primal method for minimal cost flows with applications to the assignment and transportation problems

Klein, M. (1967). A primal method for minimal cost flows with applications to the assignment and transportation problems.

Type

Unclassified

Intellectual base

Unclassified

Year

1967

DOI

10.1287/mnsc.14.3.205

Link

https://doi.org/10.1287/mnsc.14.3.205

Cited by

1 citation across 1 artifact.

Domain-specific

• Minimum-cost flow problem
  • … identity and a convenient observable transfers from A distributor sends required units from factories to warehouses through limited routes at minimum shipping cost. to An implementation checks integrality, negative cycles, units and demand feasibility and reports both primal flow and optimality certificate..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:16fd657579fe · see in the full table