On solving maximum and quickest interval-valued flows over time
From MaRDI portal
Publication:2988443
DOI10.3233/IFS-151760zbMath1361.90014MaRDI QIDQ2988443
Reza Rostami, Ali Ebrahimnejad
Publication date: 19 May 2017
Published in: Journal of Intelligent & Fuzzy Systems (Search for Journal in Brave)
temporally repeated flowsinterval-valued capacitiesinterval-valued transit timesmaximum flows over time
Cites Work
- Unnamed Item
- On sufficiency and duality for a class of interval-valued programming problems
- Violation analysis on two-step method for interval linear programming
- The maximum flow in dynamic networks
- A survey of dynamic network flows
- Application of fuzzy minimum cost flow problems to network design under uncertainty
- Efficient continuous-time dynamic network flow algorithms
- Numerical solutions comparison for interval linear programming problems based on coverage and validity rates
- Strong optimal solutions of interval linear programming
- Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming
- Solving the shortest path problem with interval arcs
- A duality approach for solving bounded linear programming problems with fuzzy variables based on ranking functions and its application in bounded transportation problems
- On solving bounded fuzzy variable linear program and its applications
- Finding minimum-cost circulations by canceling negative cycles
- A Class of Continuous Network Flow Problems
- The quickest flow problem
- Continuous-Time Flows in Networks
- A fuzzy max-flow min-cut theorem.
This page was built for publication: On solving maximum and quickest interval-valued flows over time
