1997Combinatorial optimizationRequires access

Minimum‐Cost Flow Problems

William J. Cook, William H. Cunningham, William R. Pulleyblank, Alexander Schrijver

Open publisher page 5 citations

Abstract

This chapter contains sections titled: Minimum-Cost Flow Problems Primal Minimum-Cost Flow Algorithms Dual Minimum-Cost Flow Algorithms Dual Scaling Algorithms

About this research paper

What this paper is about

This chapter contains sections titled: Minimum-Cost Flow Problems Primal Minimum-Cost Flow Algorithms Dual Minimum-Cost Flow Algorithms Dual Scaling Algorithms

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This chapter contains sections titled: Minimum-Cost Flow Problems Primal Minimum-Cost Flow Algorithms Dual Minimum-Cost Flow Algorithms Dual Scaling Algorithms

Key concepts: Minimum-cost flow problem, Flow (mathematics), Computer science, Mathematics, Geometry

Related papers

Back to paper searchBrowse research topicsOriginal source
Minimum‐Cost Flow Problems — Research Paper | ScholarLens