A new approach for solving the network problems

DOI10.1007/s12597-012-0063-8zbMath1353.90032MaRDI QIDQ505104

Yong-Cai Geng, Sumit K. Garg

Publication date: 19 January 2017

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-012-0063-8

zbMATH Keywords

shortest path; networks; critical path; Floyd's and Pandit's algorithms; max-flow

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B06: Transportation, logistics and supply chain management

90B35: Deterministic scheduling theory in operations research

90B10: Deterministic network models in operations research