scientific article; zbMATH DE number 1263274
From MaRDI portal
Publication:4234147
Recommendations
Cited in
(20)- Finding minimum-cost flows by double scaling
- On the computational behavior of a polynomial-time network flow algorithm
- Efficient parallel algorithms for the minimum cost flow problem
- On implementing the push-relabel method for the maximum flow problem
- On dual minimum cost flow algorithms
- An efficient cost scaling algorithm for the assignment problem
- A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project
- A computational study of cost reoptimization for min-cost flow problems
- A Simple Efficient Interior Point Method for Min-Cost Flow
- Minimum-cost flow algorithms: an experimental evaluation
- An efficient implementation of the network simplex method
- scientific article; zbMATH DE number 150473 (Why is no real title available?)
- scientific article; zbMATH DE number 1303553 (Why is no real title available?)
- scientific article; zbMATH DE number 515927 (Why is no real title available?)
- scientific article; zbMATH DE number 515928 (Why is no real title available?)
- scientific article; zbMATH DE number 515930 (Why is no real title available?)
- Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost
- Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm
- scientific article; zbMATH DE number 5039783 (Why is no real title available?)
- An efficient network flow code for finding all minimum cost \(s-t\) cutsets
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 Q4234147)
