scientific article; zbMATH DE number 1163718
zbMATH Open0901.05085MaRDI QIDQ4395331FDOQ4395331
Authors: R. Ravi, S. S. Ravi, Sven O. Krumke, Madhav V. Marathe, Hartmut Noltemeier 
Publication date: 4 August 1998
Title of this publication is not available (Why is that?)
Recommendations
Large-scale problems in mathematical programming (90C06) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Cited In (16)
- Upgrading arcs to minimize the maximum travel time in a network
- To improve the communication delay by upgrading nodes in a continuous version
- Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
- Optimizing cost flows by edge cost and capacity upgrade
- Title not available (Why is that?)
- Best upgrade plans for large road networks
- Improving multicut in directed trees by upgrading nodes
- Improving spanning trees by upgrading nodes
- Optimal upgrading schemes for effective shortest paths in networks
- A GRASP metaheuristic to improve accessibility after a disaster
- Upgrading \(p\)-median problem on a path
- Robust flows with losses and improvability in evacuation planning
- Up- and downgrading the 1-center in a network
- Improving Minimum Cost Spanning Trees by Upgrading Nodes
- Network upgrading problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4395331)
