scientific article; zbMATH DE number 1022488

MaRDI QIDQ4340085zbMATH OpenFDO

Authors A. Sedeño-Noda, C. González-Martín

Publication date 15 September 1997

zbMATH Keywords

maximum flownetwork

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• An algorithmic study of the maximum flow problem: A comparative statistical analysis
• A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem
• scientific article; zbMATH DE number 2163908
• Algorithms for maximum network flow
• scientific article; zbMATH DE number 515922

Cited in

(12)

• An incremental algorithm for the maximum flow problem
• An algorithmic study of the maximum flow problem: A comparative statistical analysis
• Enhanced instance space analysis for the maximum flow problem
• New algorithm for maximum flow algorithm in network with both node and edge capacity confined
• scientific article; zbMATH DE number 515922 (Why is no real title available?)
• scientific article; zbMATH DE number 706868 (Why is no real title available?)
• scientific article; zbMATH DE number 1538873 (Why is no real title available?)
• scientific article; zbMATH DE number 2163908 (Why is no real title available?)
• scientific article; zbMATH DE number 218386 (Why is no real title available?)
• Algorithm model research of the logical cutting tree on the network maximum flow
• A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem
• Playing with the Maximum-Flow Problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340085)