Optimal Network Design with End-to-End Service Requirements
From MaRDI portal
Publication:4604906
DOI10.1287/opre.2016.1579zbMath1387.90045OpenAlexW2601580879MaRDI QIDQ4604906
Prakash Mirchandani, Anantaram Balakrishnan, Gang Li
Publication date: 6 March 2018
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2016.1579
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
Network Design with Service Requirements: Scaling-up the Size of Solvable Problems ⋮ Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models ⋮ Heterogeneous flow distribution at the peak load in the multiuser network ⋮ Optimizing package express operations in China ⋮ Quantitative analysis of flow distributions in a multiuser telecommunication network ⋮ Analysis of the load distribution and internodal flows under different routing strategies in a multiuser network
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New approaches to multi-objective optimization
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- Service network design with management and coordination of multiple fleets
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
- A constrained Steiner tree problem
- On the directed hop-constrained shortest path problem
- Service network design in freight transportation
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- Conflict graphs in solving integer programming problems
- The two-level diameter constrained spanning tree problem
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- The hardness of approximating spanner problems
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
- Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
- Improved Approximation for the Directed Spanner Problem
- Geometric Spanner Networks
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Graph spanners
- A composite algorithm for a concave-cost network flow problem
- An algorithm for the resource constrained shortest path problem
- A dual algorithm for the constrained shortest path problem
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- Bicriteria Network Design Problems
- Air Network Design for Express Shipment Service
- Composite Variable Formulations for Express Shipment Service Network Design
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- A directed cycle-based column-and-cut generation method for capacitated survivable network design
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Multimodal Express Package Delivery: A Service Network Design Application
- The constrained minimum spanning tree problem
- Connectivity Upgrade Models for Survivable Network Design
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
