Models and algorithms for network reduction
From MaRDI portal
Recommendations
- Reduction of the complexity of models of network structures and systems
- Reduced-order modeling of large-scale network systems
- Reduction of Boolean network models
- Models and algorithms for network design problems
- Physical network systems and model reduction
- Structure-preserving model reduction of physical network systems
- Graph simplification for infrastructure network design
- scientific article; zbMATH DE number 3860397
Cites work
- scientific article; zbMATH DE number 1617347 (Why is no real title available?)
- scientific article; zbMATH DE number 3568354 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1867292 (Why is no real title available?)
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Graph-Theoretic Game and Its Application to the k-Server Problem
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
- A dual ascent approach for steiner tree problems on a directed graph
- A dual ascent approach to the fixed-charge capacitated network design problem
- A fast algorithm for computing minimum routing cost spanning trees
- A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem
- A review of recent research on green road freight transportation
- A review of the contribution of operational research to project management
- Algorithms for the optimum communication spanning tree problem
- Approximation algorithms for some optimum communication spanning tree problems
- Approximation algorithms for the optimal \(p\)-source communication spanning tree
- Approximation algorithms for the shortest total path length spanning tree problem
- Compact routing with minimum stretch
- Dual-based local search for the connected facility location and related problems
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- Euclidean shortest paths. Exact or approximate algorithms.
- Exact algorithms for minimum routing cost trees
- Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
- Generating Sparse 2-Spanners
- Geometric Spanner Networks
- Graph spanners
- Heuristic shortest path algorithms for transportation applications: state of the art
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Improved approximation for the directed spanner problem
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Multimodal freight transportation planning: a literature review
- Network flows. Theory, algorithms, and applications.
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- Optimal routing in a transportation network
- Optimizing splitter and fiber location in a multilevel optical FTTH network
- Optimum Communication Spanning Trees
- Problem reduction methods and a tree generation algorithm for the steiner network problem
- Service network design in freight transportation
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The complexity of the network design problem
- The hardness of approximating spanner problems
- The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem
- Worst-Case Analysis of Network Design Problem Heuristics
Cited in
(4)
This page was built for publication: Models and algorithms for network reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320811)
