Optimal network design with end-to-end service requirements

DOI10.1287/OPRE.2016.1579zbMATH Open1387.90045OpenAlexW2601580879MaRDI QIDQ4604906FDOQ4604906

Authors: Anantaram Balakrishnan, Gang Li, P. Mirchandani 

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

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

zbMATH Keywords

integer programmingpolyhedral methodsservice networks

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Integer programming (90C10)

Cites Work

• Network flows. Theory, algorithms, and applications.
• The constrained minimum spanning tree problem
• Geometric Spanner Networks
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Title not available (Why is that?)
• Conflict graphs in solving integer programming problems
• Graph spanners
• Steiner tree problems in telecommunications
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
• Service network design in freight transportation
• Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Connectivity Upgrade Models for Survivable Network Design
• On formulations and methods for the hop-constrained minimum spanning tree problem
• Service network design with management and coordination of multiple fleets
• A Dual-Ascent Procedure for Large-Scale Uncapacitated 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
• Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
• The hardness of approximating spanner problems
• Improved approximation for the directed spanner problem
• An algorithm for the resource constrained shortest path problem
• Title not available (Why is that?)
• On the directed hop-constrained shortest path problem
• A dual algorithm for the constrained shortest path problem
• Using a Hop-Constrained Model to Generate Alternative Communication Network Design
• Composite Variable Formulations for Express Shipment Service Network Design
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
• The two-level diameter constrained spanning tree problem
• Mathematical programming algorithms for two-path routing problems with reliability considerations
• New approaches to multi-objective optimization
• Title not available (Why is that?)
• A composite algorithm for a concave-cost network flow problem
• Title not available (Why is that?)
• Multimodal Express Package Delivery: A Service Network Design Application
• Air Network Design for Express Shipment Service
• A constrained Steiner tree problem
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
• Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem

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
• Analysis of nodal multiflows in a multiuser system with equalizing control strategies
• Resource distribution and balancing flows in a multiuser network
• Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models

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)