Models and algorithms for network reduction

DOI10.1016/J.EJOR.2015.08.008zbMATH Open1346.90222OpenAlexW1128195214MaRDI QIDQ320811FDOQ320811

Authors: Anantaram Balakrishnan, Gang Li 

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.08.008

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

zbMATH Keywords

heuristicsnetworkslarge scale optimizationshortest pathdual ascent

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Integer programming (90C10)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Title not available (Why is that?)
• A dual ascent approach to the fixed-charge capacitated network design problem
• A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• Geometric Spanner Networks
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Graph spanners
• The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
• Approximation algorithms for the shortest total path length spanning tree problem
• Service network design in freight transportation
• Dual-based local search for the connected facility location and related problems
• A review of recent research on green road freight transportation
• Multimodal freight transportation planning: a literature review
• Euclidean shortest paths. Exact or approximate algorithms.
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs
• The complexity of the network design problem
• Heuristic shortest path algorithms for transportation applications: state of the art
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• A Dual-Based Procedure for Uncapacitated Facility Location
• Optimal routing in a transportation network
• Approximation algorithms for some optimum communication spanning tree problems
• Approximation algorithms for the optimal \(p\)-source communication spanning tree
• Optimizing splitter and fiber location in a multilevel optical FTTH network
• Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
• A fast algorithm for computing minimum routing cost spanning trees
• The hardness of approximating spanner problems
• Algorithms for the optimum communication spanning tree problem
• Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem
• Compact routing with minimum stretch
• Title not available (Why is that?)
• Improved approximation for the directed spanner problem
• Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
• Optimum Communication Spanning Trees
• A dual ascent approach for steiner tree problems on a directed graph
• Problem reduction methods and a tree generation algorithm for the steiner network problem
• Worst-Case Analysis of Network Design Problem Heuristics
• Title not available (Why is that?)
• Generating Sparse 2-Spanners
• A Graph-Theoretic Game and Its Application to the k-Server Problem
• Exact algorithms for minimum routing cost trees
• Title not available (Why is that?)
• A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
• A review of the contribution of operational research to project management

Cited In (4)

• New valid inequalities for the optimal communication spanning tree problem
• Title not available (Why is that?)
• Network reduction for the acyclic constrained shortest path problem
• Network flow problem heuristic reduction using machine learning

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)