On the enrouting protocol problem under uncertainty

DOI10.1016/j.ejor.2006.06.022zbMath1131.90318OpenAlexW2082595770MaRDI QIDQ877076

Joaquín Sánchez-Soriano, Laureano Fernando Escudero Bueno, Marcos Almiñana, Juan Francisco 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

genetic algorithmmodelenrouting arc generationenrouting protocolsinformation flow matrixO--Dtwo-stage stochastic mixed

Mathematics Subject Classification ID

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

Related Items (1)

Some recent contributions to routing and location problems

Uses Software

• Genocop

Cites Work

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

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