A new approach for solving the network problems

DOI10.1007/s12597-012-0063-8zbMath1353.90032OpenAlexW1982970978MaRDI 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 pathnetworkscritical pathFloyd's and Pandit's algorithmsmax-flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (1)

The problem of maximum flow with minimum attainable cost in a network

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Topological design of telecommunication networks --- local access design methods
• An efficient approximation algorithm for the survivable network design problem
• Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
• An incremental algorithm for the maximum flow problem
• Benders-and-cut algorithm for fixed-charge capacitated network design problem
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Maximal Flow Through a Network
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
• Decision CPM: Network Reduction and Solution
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• A decomposition algorithm for capacity expansion of local access networks
• Scheduling Tasks with AND/OR Precedence Constraints
• A memetic algorithm to schedule planned maintenance for the national grid
• Faster shortest-path algorithms for planar graphs

This page was built for publication: A new approach for solving the network problems