Solving the minimum flow problem with interval bounds and flows
From MaRDI portal
Publication:746432
Recommendations
- A new approach for solving the minimum cost flow problem with interval and fuzzy data
- Minimum cost flow time-windows problem with interval bounds and flows
- Combinatorial algorithms for the minimum interval cost flow problem
- A note on the minimum interval cost flow problem
- Minimum flow problem on network flows with time-varying bounds
Cites work
- scientific article; zbMATH DE number 1498519 (Why is no real title available?)
- scientific article; zbMATH DE number 869746 (Why is no real title available?)
- scientific article; zbMATH DE number 2194036 (Why is no real title available?)
- A Computational Test for Convergence of Iterative Methods for Nonlinear Systems
- A fuzzy max-flow min-cut theorem.
- A new approach for solving the minimum cost flow problem with interval and fuzzy data
- A note on the extension principle for fuzzy sets
- Algorithms for minimum flows.
- Inverse minimum flow problem
- Minimum flow algorithms. Dynamic tree implementations
- Sequential and parallel algorithms for minimum flows.
Cited in
(6)- Integral flow decomposition with minimum longest path length
- Combinatorial algorithms for the minimum interval cost flow problem
- On solving maximum and quickest interval-valued flows over time
- Minimum cost flow time-windows problem with interval bounds and flows
- A new approach for solving the minimum cost flow problem with interval and fuzzy data
- A note on the minimum interval cost flow problem
This page was built for publication: Solving the minimum flow problem with interval bounds and flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q746432)
