On solving maximum and quickest interval-valued flows over time

DOI10.3233/IFS-151760MaRDI QIDQ2988443zbMATH OpenFDO

Authors Reza Rostami, Ali Ebrahimnejad

Publication date 19 May 2017

Published in Journal of Intelligent & Fuzzy Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/IFS-151760

zbMATH Keywords

interval-valued capacitiesinterval-valued transit timesmaximum flows over timetemporally repeated flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Time-varying universal maximum flow problems
• Improved Time Bounds for the Maximum Flow Problem
• The maximum flow problem: a real-time approach
• Generalized Maximum Flows over Time
• Solving the minimum flow problem with interval bounds and flows
• A mixed integer programming approach for the minimum maximal flow
• An Approximation for a Continuous Max-Flow Problem
• Minimum flow problem on network flows with time-varying bounds
• Complexity of minimizing the total flow time with interval data and minmax regret criterion
• scientific article; zbMATH DE number 15416

Cites work

• A Class of Continuous Network Flow Problems
• A duality approach for solving bounded linear programming problems with fuzzy variables based on ranking functions and its application in bounded transportation problems
• A fuzzy max-flow min-cut theorem.
• A survey of dynamic network flows
• Application of fuzzy minimum cost flow problems to network design under uncertainty
• Continuous-Time Flows in Networks
• Efficient continuous-time dynamic network flow algorithms
• Finding minimum-cost circulations by canceling negative cycles
• scientific article; zbMATH DE number 6375267 (Why is no real title available?)
• Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming
• Numerical solutions comparison for interval linear programming problems based on coverage and validity rates
• On solving bounded fuzzy variable linear program and its applications
• On sufficiency and duality for a class of interval-valued programming problems
• Solving the shortest path problem with interval arcs
• Strong optimal solutions of interval linear programming
• The maximum flow in dynamic networks
• The quickest flow problem
• Violation analysis on two-step method for interval linear programming

This page was built for publication: On solving maximum and quickest interval-valued flows over time

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