A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem

DOI10.1016/j.ejor.2008.07.020zbMath1159.90321OpenAlexW2024059974MaRDI QIDQ1014998

Kevin P. Scheibe, Cliff T. Ragsdale

Publication date: 30 April 2009

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

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

zbMATH Keywords

network planninghop-constrainedbroadband wireless meshcapacitated networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items

Single-Commodity Network Design with Stochastic Demand and Multiple Sources and Sinks, Goal-programming-driven genetic algorithm model for wireless access point deployment optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Models for planning capacity expansion in local access telecommunication networks
• Topological design of telecommunication networks --- local access design methods
• Solving to optimality the uncapacitated fixed-charge network flow problem
• Multicommodity flow models for spanning trees with hop constraints
• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
• The Steiner tree problem with hop constraints
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• Projections of the capacitated network loading problem
• Hop constrained network design problem with partial survivability
• New formulations and solution procedures for the hop constrained network design problem.
• The capacitated minimum spanning tree problem: On improved multistar constraints
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• Designing Hierarchical Survivable Networks
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Backbone Network Design Tools with Economic Tradeoffs
• Using a Hop-Constrained Model to Generate Alternative Communication Network Design
• Primary and Secondary Route Selection in Backbone Computer Networks
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• Packet Routing in Telecommunication Networks with Path and Flow Restrictions
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems
• A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning