A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem (Q1014998): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2008.07.020
+Normal rank
@@ Property / OpenAlex ID @@
+W2024059974
@@ Property / OpenAlex ID: W2024059974 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Using a Hop-Constrained Model to Generate Alternative Communication Network Design
+Normal rank
@@ Property / cites work @@
+Models for planning capacity expansion in local access telecommunication networks
+Normal rank
@@ Property / cites work @@
+A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
+Normal rank
@@ Property / cites work @@
+Designing Hierarchical Survivable Networks
@@ Property / cites work: Designing Hierarchical Survivable Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems
+Normal rank
@@ Property / cites work @@
+Solving to optimality the uncapacitated fixed-charge network flow problem
+Normal rank
@@ Property / cites work @@
+Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
+Normal rank
@@ Property / cites work @@
+Topological design of telecommunication networks --- local access design methods
+Normal rank
@@ Property / cites work @@
+Backbone Network Design Tools with Economic Tradeoffs
+Normal rank
@@ Property / cites work @@
+Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
+Normal rank
@@ Property / cites work @@
+Multicommodity flow models for spanning trees with hop constraints
+Normal rank
@@ Property / cites work @@
+Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
+Normal rank
@@ Property / cites work @@
+The capacitated minimum spanning tree problem: On improved multistar constraints
+Normal rank
@@ Property / cites work @@
+The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
+Normal rank
@@ Property / cites work @@
+Q4944737
@@ Property / cites work: Q4944737 / rank @@
+Normal rank
@@ Property / cites work @@
+A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
+Normal rank
@@ Property / cites work @@
+Packet Routing in Telecommunication Networks with Path and Flow Restrictions
+Normal rank
@@ Property / cites work @@
+Networks synthesis and optimum network design problems: Models, solution methods and applications
+Normal rank
@@ Property / cites work @@
+Projections of the capacitated network loading problem
+Normal rank
@@ Property / cites work @@
+Primary and Secondary Route Selection in Backbone Computer Networks
+Normal rank
@@ Property / cites work @@
+New formulations and solution procedures for the hop constrained network design problem.
+Normal rank
@@ Property / cites work @@
+Hop constrained network design problem with partial survivability
+Normal rank
@@ Property / cites work @@
+The Steiner tree problem with hop constraints
@@ Property / cites work: The Steiner tree problem with hop constraints / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1014998