On the enrouting protocol problem under uncertainty
DOI10.1016/J.EJOR.2006.06.022zbMATH Open1131.90318OpenAlexW2082595770MaRDI QIDQ877076FDOQ877076
J. Sánchez-Soriano, Laureano F. Escudero Bueno, Marcos Almiñana, 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
modelgenetic algorithmenrouting arc generationenrouting protocolsinformation flow matrixO--Dtwo-stage stochastic mixed
Approximation methods and heuristics in mathematical programming (90C59) Stochastic programming (90C15) Mixed integer programming (90C11) Communication networks in operations research (90B18)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on two problems in connexion with graphs
- Partitioning procedures for solving mixed-variables programming problems
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- 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
- Introduction to Stochastic Programming
- Stochastic programming with integer variables
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs
- The hub location and routing problem
- A parallel computation approach for solving multistage stochastic network problems
- A diagonal quadratic approximation method for large scale linear programs
- An augmented Lagrangian decomposition method for block diagonal linear programming problems
- 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
- B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
- Optimizing electricity distribution using two-stage integer recourse models
- Chance-constrained stochastic programming for integrated services network management
- Overflow and loss probabilities in a finite ATM buffer fed by self-similar traffic
Cited In (2)
Uses Software
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)
