Network upgrading problems

DOI10.1002/NET.3230260105MaRDI QIDQ4861346zbMATH OpenOpenAlexFDO

Authors Doowon Paik, Sartaj Sahni

Publication date 16 January 1996

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230260105

zbMATH Keywords

polynomial time algorithmsgraphs with weights and delayssignal flow networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 1163718
• Approximation algorithms for certain network improvement problems
• scientific article; zbMATH DE number 1262800
• scientific article; zbMATH DE number 1203392
• To improve the communication delay by upgrading nodes in a continuous version

Cited in

(19)

• To improve the communication delay by upgrading nodes in a continuous version
• Improving spanning trees by upgrading nodes
• The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation
• Upgrading nodes in tree-shaped hub location
• Upgrading bottleneck constrained forests
• Upgrading edge-disjoint paths in a ring
• Upgrading min-max spanning tree problem under various cost functions
• Upgrading edges in the graphical TSP
• Improving spanning trees by upgrading nodes
• Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
• Upgrading arcs to minimize the maximum travel time in a network
• Up- and downgrading the 1-center in a network
• Optimizing cost flows by edge cost and capacity upgrade
• On the complexity of the upgrading version of the maximal covering location problem
• On budget-constrained flow improvement.
• Upgrading edges in the maximal covering location problem
• Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies
• Optimizing budget allocation for center and median points
• Minimizing broadcast costs under edge reductions in tree networks

This page was built for publication: Network upgrading problems

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