Optimal network design with end-to-end service requirements
From MaRDI portal
Publication:4604906
Recommendations
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
- Multicommodity network flow models and algorithms in telecommunications
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Optimal solution of the discrete cost multicommodity network design problem
- Network design and dynamic routing under queueing demand
Cites work
- scientific article; zbMATH DE number 1175958 (Why is no real title available?)
- scientific article; zbMATH DE number 2159269 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- scientific article; zbMATH DE number 5070513 (Why is no real title available?)
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- A composite algorithm for a concave-cost network flow problem
- A constrained Steiner tree problem
- A directed cycle-based column-and-cut generation method for capacitated survivable network design
- A dual algorithm for the constrained shortest path problem
- Air Network Design for Express Shipment Service
- An algorithm for the resource constrained shortest path problem
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
- Composite Variable Formulations for Express Shipment Service Network Design
- Conflict graphs in solving integer programming problems
- Connectivity Upgrade Models for Survivable Network Design
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
- Geometric Spanner Networks
- Graph spanners
- Improved approximation for the directed spanner problem
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- Mathematical programming algorithms for two-path routing problems with reliability considerations
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- Multimodal Express Package Delivery: A Service Network Design Application
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- Network flows. Theory, algorithms, and applications.
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- New approaches to multi-objective optimization
- On formulations and methods for the hop-constrained minimum spanning tree problem
- On the directed hop-constrained shortest path problem
- Service network design in freight transportation
- Service network design with management and coordination of multiple fleets
- Steiner tree problems in telecommunications
- The constrained minimum spanning tree problem
- The hardness of approximating spanner problems
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- The two-level diameter constrained spanning tree problem
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
Cited in
(10)- Optimizing package express operations in China
- Quantitative analysis of flow distributions in a multiuser telecommunication network
- Design and scheduling problems in planning optical networks
- Heterogeneous flow distribution at the peak load in the multiuser network
- A computational study on integer programming formulations for hop-constrained survivable network design
- Network Design with Service Requirements: Scaling-up the Size of Solvable Problems
- Analysis of the load distribution and internodal flows under different routing strategies in a multiuser network
- Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models
- Analysis of nodal multiflows in a multiuser system with equalizing control strategies
- Resource distribution and balancing flows in a multiuser network
This page was built for publication: Optimal network design with end-to-end service requirements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604906)
