The network design problem with relays

No abstract is available for this paper.

• Publication year

  2006

• Venue

  European Journal of Operational Research

• Publication date

  2006-06-01

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1016/j.ejor.2006.04.030
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A survey on benders decomposition applied to fixed-charge network design problems

  2005cited by this paper
• On the impact of the solution representation for the Internet Protocol Network Design Problem with max‐hop constraints

  2004cited by this paper
• Improved preprocessing, labeling and scaling algorithms for the Weight‐Constrained Shortest Path Problem

  2003influential reference
• Selected Topics in Column Generation

  2002cited by this paper
• A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem

  2001cited by this paper
• SPIDER: A simple and flexible tool for design and provisioning of protected lightpaths in optical networks

  2001cited by this paper
• Decision support system for planning telecommunication networks: a case study applied to the Andalusian region

  2001cited by this paper
• Hop Constrained Network Design Problem with Partial Survivability

  2001cited by this paper
• Using Hop-Indexed Models For Constrained Spanning and Steiner Tree Models

  1999cited by this paper
• The Steiner tree problem with hop constraints

  1999cited by this paper
• Telecommunications Network Planning

  1998cited by this paper
• Design of a distributed fiber transport network with hubbing topology

  1998cited by this paper
• Annotated Bibliographies in Combinatorial Optimization

  1997cited by this paper
• SONET Toolkit: A Decision Support System for Designing Robust and Cost-Effective Fiber-Optic Networks

  1995cited by this paper
• Conduit and cable installation for a centralized network with logical star-star topology

  1995cited by this paper

• Noise Aware Path Planning and Power Management of Hybrid Fuel UAVs

  2024cites this paper
• Enhanced bi-directional dynamic programming algorithm for the resource constrained shortest path problem

  2024cites this paper
• PathWyse: a flexible, open-source library for the resource constrained shortest path problem

  2024cites this paper
• Optimal Generator Policy for Hybrid Fuel UAV under Airspace Noise Restrictions

  2023cites this paper
• The optimal 5G base station location of the wireless sensor network considering timely reliability

  2023cites this paper
• Lagrangean Relaxation Algorithms for Fixed-Charge Capacitated Relay Network Design

  2023cites this paper
• PathWise: a flexible, open-source library for the Resource Constrained Shortest Path

  2023cites this paper
• Optimization of maritime support network with relays under uncertainty: A novel matheuristics method

  2022cites this paper
• A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization

  2022cites this paper
• On regenerator site selection in translucent optical network design

  2022cites this paper
• Exact approaches for the directed network design problem with relays

  2020cites this paper
• An exact bidirectional pulse algorithm for the constrained shortest path

  2020cites this paper
• The Multi-Stop Station Location Problem

  2020cites this paper
• Optimal deployment of charging stations considering path deviation and nonlinear elastic demand

  2020cites this paper
• Optimally Locating Charging Stations for Electric Vehicles in Intercity Highway Networks

  2019influential citation
• Exact Approaches for Network Design Problems with Relays

  2019cites this paper
• Provably High-Quality Solutions for the Meal Delivery Routing Problem

  2019cites this paper
• Extended formulation for hop constrained distribution network configuration problems

  2018cites this paper
• An Iterated Tabu Search Metaheuristic for the Regenerator Location Problem

  2018cites this paper
• The Algorithm for Constrained Shortest Path Problem Based on Incremental Lagrangian Dual Solution

  2018cites this paper
• Branch-and-price approaches for the network design problem with relays

  2018cites this paper
• Advances in Decomposition Approaches for Mixed Integer Linear Programming Candidate : Martin Riedler

  2018influential citation
• Routing and charging locations for electric vehicles for intercity trips

  2017cites this paper
• A hybrid descent method for the two-edge disjoint survivable network design problem with relays

  2017cites this paper
• Regenerator Location Problem in Flexible Optical Networks

  2017cites this paper
• An iterated metaheuristic for the directed network design problem with relays

  2017influential citation
• A variable neighborhood search for the network design problem with relays

  2017influential citation
• Models and column generation approach for the resource-constrained minimum cost path problem with relays

  2017cites this paper
• Electric vehicles: A review of network modelling and future research needs

  2016cites this paper
• Relay location in telecommunications and transportation networks

  2016influential citation
• Traffic Equilibrium and Charging Facility Locations for Electric Vehicles

  2016influential citation
• Network Design Problem with Relays

  2015cites this paper
• Regenerator Location Problem and survivable extensions: A hub covering location perspective

  2015cites this paper
• Multi-commodity k-splittable survivable network design problems with relays

  2015cites this paper
• Reliable Network Design Problem under Node Failure with Benders Decomposition

  2014cites this paper
• A tabu search based metaheuristic for the network design problem with relays

  2014influential citation
• Two-edge disjoint survivable network design problem with relays: a hybrid genetic algorithm and Lagrangian heuristic approach

  2014influential citation
• Optimal relay node placement in delay constrained wireless sensor network design

  2014cites this paper
• A survey of resource constrained shortest path problems: Exact solution approaches

  2013cites this paper
• Benders decomposition algorithms for the fixed-charge relay network design in telecommunications

  2013cites this paper
• Reliable telecommunication network design problem under node failure

  2013cites this paper
• Twenty-Five Years of Hub Location Research

  2012cites this paper
• Optimization models and algorithms for truckload relay network design

  2012cites this paper
• Using branch-and-price approach to solve the directed network design problem with relays

  2012cites this paper
• Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation

  2012influential citation
• Solving shortest path problems with a weight constraint and replenishment arcs

  2012cites this paper
• Minimum cost path problems with relays

  2011cites this paper
• Strategic Design and Analysis of a Relay Network in Truckload Transportation

  2011cites this paper
• Relay Network Design in Logistics and Telecommunications: Models and Solution Approaches

  2011influential citation
• Robust optimization for designing reliable telecommunication networks with node failure scenarios

  2010cites this paper
• Two-Edge Disjoint Survivable Network Design Problem with Relays

  2009influential citation
• Application of Parametric Cost Estimation Model to Telecommunication Networks

  2009cites this paper
• Network design and interconnection pricing in a heterogeneous terrain

  2008cites this paper
• A parametric cost model for interconnection service price determination

  2008cites this paper
• Wide area telecommunication network design: application to the Alberta SuperNet

  2008cites this paper
• A Local Search Hybrid Genetic Algorithm Approach To The Network Design Problem With Relay Stations

  2008influential citation
• Resilient Relay Logistics Network Design: A k -Shortest Path Approach

  year unknowncites this paper