Approximate Algorithms for Continuous-Time Quickest Multi-Commodity Contraflow Problem

DOI10.3126/NMSR.V37I1-2.34068OpenAlexW3120174272MaRDI QIDQ5040196

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

Publication date: 11 October 2022

Published in: The Nepali Mathematical Sciences Report (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3126/nmsr.v37i1-2.34068

zbMATH Keywords

continuous-timemulti-commodity flow\(\Delta\)-condenselength boundquickest contraflow

Mathematics Subject Classification ID

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

Related Items (2)

Dynamic multicommodity contraflow problem with asymmetric transit times ⋮ Multi-commodity flow problem on lossy network with partial lane reversals

This page was built for publication: Approximate Algorithms for Continuous-Time Quickest Multi-Commodity Contraflow Problem