Inflow-dependent quickest multi-commodity flow problem with partial lane reversals

DOI10.3934/JIMO.2025027MaRDI QIDQ6854835zbMATH OpenFDO

Authors Durga Prasad Khanal, Shiva Prakash Gupta, Urmila Pyakurel, Tanka Nath Dhamala

Publication date 23 February 2026

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/JIMO.2025027

zbMATH Keywords

multi-commodityquickest flowinflow-dependentpartial lane reversals

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 1947425 (Why is no real title available?)
• A Survey of Linear Cost Multicommodity Network Flows
• A critical survey on the network optimization algorithms for evacuation planning problems
• A dual algorithm for the constrained shortest path problem
• Abstract network flow with intermediate storage for evacuation planning
• Ambulance routing in disaster response considering variable patient condition: NSGA-II and MOPSO algorithms
• An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
• An FPTAS for quickest multicommodity flows with inflow-dependent transit times
• Approximate algorithms for continuous-time quickest multi-commodity contraflow problem
• CMARS: A new contribution to nonparametric regression with multivariate adaptive regression splines supported by continuous optimization
• Complexity analysis for maximum flow problems with arc reversals
• Continuous dynamic contraflow approach for evacuation planning
• Dynamic network flow location models and algorithms for quickest evacuation planning
• Dynamics of disasters. Algorithmic approaches and applications. Based on the 3rd international conference on dynamics of disasters, Kalamata, Greece, July 2017
• Efficient continuous contraflow algorithms for evacuation planning problems
• Efficient continuous-time dynamic network flow algorithms
• Efficient contraflow algorithms for quickest evacuation planning
• Finding Minimum-Cost Circulations by Successive Approximation
• FlowLoc problems with maximum excess flow
• Flows over Time with Load-Dependent Transit Times
• Multi-objective two-stage grey transportation problem using utility function with goals
• Multicommodity flows over time: Efficient algorithms and complexity
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• Multicommodity network flows—A survey
• Network flow with intermediate storage: models and algorithms
• Network flows. Theory, algorithms, and applications.
• On the quickest flow problem in dynamic networks -- a parametric min-cost flow approach
• Optimal multicommodity network flows with resource allocation
• Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
• Progress Made in Solving the Multicommodity Flow Problem
• Quickest Flows Over Time
• RCMARS: robustification of CMARS with different scenarios under polyhedral uncertainty set
• Robust optimization in spline regression models for multi-model regulatory networks under polyhedral uncertainty
• Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
• The quickest flow problem
• Two commodity network flows and linear programming
• Uncertain multi-objective multi-route shortest path problem by robust enhanced non-dominated sorting genetic algorithms: application to emergency medical services
• Validation of subgradient optimization

This page was built for publication: Inflow-dependent quickest multi-commodity flow problem with partial lane reversals

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