Computational and Information Science

DOI10.1007/B104566MaRDI QIDQ5491591zbMATH OpenOpenAlexFDO

Authors Yuhua Liu, Jingzhong Mao, Peng Yang, Sheng Sheng Yu

Publication date 10 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104566

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Programming involving graphs or networks (90C35)

Recommendations

• On the bottleneck capacity expansion problems on networks
• On the optimum capacity of capacity expansion problems
• Optimal expansion of capacitated transshipment networks
• The capacity expansion problem on directed networks
• Capacity expansion problem on an undirected network

Cited in

(12)

• A heuristic approach for capacity expansion of packet networks
• Choosing the capacity of arcs with constraint on flow delay time
• On the optimum capacity of capacity expansion problems
• Network expansion by adding arcs and/or nodes
• On the bottleneck capacity expansion problems on networks
• The capacity expansion problem on directed networks
• Research on network max-flow Pareto expansion problem
• The capacity expansion path problem in networks
• A constrained capacity expansion problem on networks
• A network recourse decomposition method for dynamic networks with random arc capacities
• EVOLUTION ALGORITHM FOR OPTIMAL CAPACITY EXPANSION
• Multiperiod capacity expansion of road networks: Formulation and algorithms

This page was built for publication: Computational and Information Science

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