Models and algorithms for network reduction
From MaRDI portal
Publication:320811
DOI10.1016/J.EJOR.2015.08.008zbMath1346.90222OpenAlexW1128195214MaRDI QIDQ320811
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
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A review of recent research on green road freight transportation
- Multimodal freight transportation planning: a literature review
- A dual ascent approach to the fixed-charge capacitated network design problem
- Optimal routing in a transportation network
- Approximation algorithms for some optimum communication spanning tree problems
- Approximation algorithms for the shortest total path length spanning tree problem
- Service network design in freight transportation
- A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem
- Approximation algorithms for the optimal \(p\)-source communication spanning tree
- Optimizing splitter and fiber location in a multilevel optical FTTH network
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- 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
- Heuristic shortest path algorithms for transportation applications: state of the art
- Algorithms for the optimum communication spanning tree problem
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem
- Compact Routing with Minimum Stretch
- Dual-Based Local Search for the Connected Facility Location and Related Problems
- Improved Approximation for the Directed Spanner Problem
- Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
- Euclidean Shortest Paths
- Optimum Communication Spanning Trees
- A dual ascent approach for steiner tree problems on a directed graph
- Geometric Spanner Networks
- The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
- Problem reduction methods and a tree generation algorithm for the steiner network problem
- Graph spanners
- A Dual-Based Procedure for Uncapacitated Facility Location
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Worst-Case Analysis of Network Design Problem Heuristics
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- The complexity of the network design problem
- Generating Sparse 2-Spanners
- A Graph-Theoretic Game and Its Application to the k-Server Problem
- Exact algorithms for minimum routing cost trees
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
- A review of the contribution of operational research to project management
This page was built for publication: Models and algorithms for network reduction
