The network design problem with relays

DOI10.1016/j.ejor.2006.04.030zbMath1125.90010OpenAlexW2067773876MaRDI QIDQ869627

Erhan Erkut, Raymond A. Patterson, Gilbert Laporte, Edgar Alberto Cabral

Publication date: 8 March 2007

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

Full work available at URL: http://hdl.handle.net/11693/23426

zbMATH Keywords

column generationheuristicnetwork designtelecommunications

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (12)

Optimal relay node placement in delay constrained wireless sensor network design ⋮ Branch-and-price approaches for the network design problem with relays ⋮ A variable neighborhood search for the network design problem with relays ⋮ Extended formulation for hop constrained distribution network configuration problems ⋮ An exact bidirectional pulse algorithm for the constrained shortest path ⋮ A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization ⋮ Regenerator Location Problem in Flexible Optical Networks ⋮ Exact Approaches for Network Design Problems with Relays ⋮ Traffic equilibrium and charging facility locations for electric vehicles ⋮ Solving shortest path problems with a weight constraint and replenishment arcs ⋮ Minimum cost path problems with relays ⋮ A survey of resource constrained shortest path problems: Exact solution approaches

Uses Software

• SONET
• SPIDER

Cites Work

• The Steiner tree problem with hop constraints
• Design of a distributed finer transport network with hubbing topology
• Hop constrained network design problem with partial survivability
• A survey on Benders decomposition applied to fixed-charge network design problems
• On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• Decision support system for planning telecommunication networks: a case study applied to the Andalusian region
• Selected Topics in Column Generation
• A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The network design problem with relays