On the enrouting protocol problem under uncertainty

DOI10.1016/J.EJOR.2006.06.022MaRDI QIDQ877076zbMATH OpenOpenAlexFDO

Authors J. Sánchez-Soriano, Marcos Almiñana, Laureano F. Escudero Bueno, Juan F. Monge

Publication date 19 April 2007

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

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

zbMATH Keywords

modelgenetic algorithmenrouting arc generationenrouting protocolsinformation flow matrixO--Dtwo-stage stochastic mixed

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic programming (90C15) Mixed integer programming (90C11) Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 4057261
• On a bi-dimensional dynamic alternative routing method
• Optimal routing for minimizing the maximal link congestion
• scientific article; zbMATH DE number 3922330
• Routing of uncertain traffic demands

Cites work

• scientific article; zbMATH DE number 4215340 (Why is no real title available?)
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 1086903 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• A diagonal quadratic approximation method for large scale linear programs
• A note on two problems in connexion with graphs
• A parallel computation approach for solving multistage stochastic network problems
• ATM VP-based network design
• ATM routing algorithms for multimedia traffic in private ATM networks
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• An augmented Lagrangian decomposition method for block diagonal linear programming problems
• BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
• B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
• Chance-constrained stochastic programming for integrated services network management
• Detecting and preventing routing problems in the planning process of CCSS\#7 networks
• Dual decomposition in stochastic integer programming
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Integer programming formulations of discrete hub location problems
• Introduction to Stochastic Programming
• Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs
• Optimizing electricity distribution using two-stage integer recourse models
• Overflow and loss probabilities in a finite ATM buffer fed by self-similar traffic
• Partitioning procedures for solving mixed-variables programming problems
• Stochastic programming with integer variables
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• The hub location and routing problem
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Virtual path design in service-specific ATM networks

Cited in

(3)

• Some recent contributions to routing and location problems
• Stochastic RWA and lightpath rerouting in WDM networks
• scientific article; zbMATH DE number 934440 (Why is no real title available?)

Describes a project that uses

Uses Software

• Genocop

This page was built for publication: On the enrouting protocol problem under uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877076)