A strongly polynomial minimum cost circulation algorithm

Tardos, É. (1985). A strongly polynomial minimum cost circulation algorithm.

Type

Unclassified

Intellectual base

Unclassified

Year

1985

DOI

10.1007/bf02579369

Link

https://doi.org/10.1007/bf02579369

Cited by

1 citation across 1 artifact.

Domain-specific

• Circulation problem
  • Unlike ordinary source-sink flow every vertex obeys balance unless supplies and demands are explicitly added, lower bounds require a feasibility transformation and multicommodity circulation is a harder variant.

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:9ff4960ec50b · see in the full table