A mixed integer programming approach for the minimum maximal flow
From MaRDI portal
Recommendations
- A global optimization method for minimum maximal flow problem
- OUTER APPROXIMATION METHOD FOR THE MINIMUM MAXIMAL FLOW PROBLEM
- scientific article; zbMATH DE number 2190137
- D.c. optimization methods for solving minimum maximal network flow problem
- Global optimization method for solving the minimum maximal flow problem
Cited in
(14)- Complexity and approximability of the maximum flow problem with minimum quantities
- A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem
- Bi-objective min-flow problem with capacity and flow constraints
- An algorithm for the biobjective integer minimum cost flow problem
- Integral flow decomposition with minimum longest path length
- scientific article; zbMATH DE number 634022 (Why is no real title available?)
- The multiroute maximum flow problem revisited
- On solving maximum and quickest interval-valued flows over time
- scientific article; zbMATH DE number 3891077 (Why is no real title available?)
- A New Min‐Cut Max‐Flow Ratio for Multicommodity Flows
- Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads
- Integer plane multiflow maximisation: one-quarter-approximation and gaps
- A new MIP approach on the least distance problem in DEA
- On the equivalence of the maximum balanced flow problem and the weighted minimax flow problem
This page was built for publication: A mixed integer programming approach for the minimum maximal flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645555)
