General network design: a unified view of combined location and network design problems

DOI10.1016/J.EJOR.2011.11.009zbMath1253.90058OpenAlexW2015646948MaRDI QIDQ1926688

Elena Fernández, Iván A. Contreras

Publication date: 29 December 2012

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

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

zbMATH Keywords

locationnetwork locationnetwork designnetwork routing

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (42)

Optimizing budget allocation for center and median points ⋮ A reliable budget-constrained FL/ND problem with unreliable facilities ⋮ Heuristic algorithms for solving an integrated dynamic center facility location -- network design model ⋮ A capacitated hub location problem in freight logistics multimodal networks ⋮ Optimal wholesale facilities location within the fruit and vegetables supply chain with bimodal transportation options: an LP-MIP heuristic approach ⋮ Improved algorithms for joint optimization of facility locations and network connections ⋮ Sustainable capacitated facility location/network design problem: a non-dominated sorting genetic algorithm based multiobjective approach ⋮ Rapid transit network design for optimal cost and origin-destination demand capture ⋮ Scatter search for an uncapacitated \(p\)-hub median problem ⋮ Achieving full connectivity of sites in the multiperiod reserve network design problem ⋮ Benders decomposition applied to a robust multiple allocation incomplete hub location problem ⋮ Combined column-and-row-generation for the optimal communication spanning tree problem ⋮ Robust gateway placement in wireless mesh networks ⋮ A branch-and-cut algorithm for two-level survivable network design problems ⋮ Hub Location as the Minimization of a Supermodular Set Function ⋮ Optimizing access to drinking water in remote areas. Application to Nepal ⋮ A look at the past and present of optimization - an editorial ⋮ Extended formulation for hop constrained distribution network configuration problems ⋮ A voltage drop limited decentralized electric power distribution network ⋮ Exact and heuristic approaches for the cycle hub location problem ⋮ On a virtual network functions placement and routing problem: Some properties and a comparison of two formulations ⋮ An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs ⋮ Strategyproof auction mechanisms for network procurement ⋮ Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem ⋮ New Valid Inequalities for the Optimal Communication Spanning Tree Problem ⋮ Majority spanning trees, cotrees and their applications ⋮ Median and covering location problems with interconnected facilities ⋮ Unnamed Item ⋮ A Lagrangian relaxation approach for expansion of a highway network ⋮ Fiber cable network design in tree networks ⋮ Branch-and-price-and-cut for a service network design and hub location problem ⋮ A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances ⋮ Multi-level facility location problems ⋮ Location of speed-up subnetworks ⋮ A combined facility location and network design problem with multi-type of capacitated links ⋮ On carriers collaboration in hub location problems ⋮ Towards optimizing the deployment of optical access networks ⋮ Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints ⋮ Allocating nodes to hubs for minimizing the hubs processing resources: A case study ⋮ The minimum flow cost Hamiltonian cycle problem: a comparison of formulations ⋮ Exact approaches for the minimum subgraph diameter problem ⋮ A competitive hub location and pricing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic uncapacitated hub location
• Lagrangean bounds for the optimum communication spanning tree problem
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• Adapting polyhedral properties from facility to hub location problems
• MIP models for connected facility location: a theoretical and computational study
• A branch-and-cut algorithm for the partitioning-hub location-routing problem
• Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
• New formulations for the uncapacitated multiple allocation hub location problem
• Tight bounds from a path based formulation for the tree of hub location problem
• Polyhedral analysis for concentrator location problems
• Location-routing: issues, models and methods
• An integrated model for logistics network design
• An extension to rapid transit network design problem
• The capacitated single-allocation hub location problem revisited: a note on a classical formulation
• 0-1 reformulations of the multicommodity capacitated network design problem
• Facility location and supply chain management. A review
• Lagrangean relaxation for the capacitated hub location problem with single assignment
• The tree of hubs location problem
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• A review of extensive facility location in networks
• Solution algorithms for the capacitated single allocation hub location problem
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Integer programming formulations of discrete hub location problems
• The median tour and maximal covering tour problems: Formulations and heuristics
• Variable neighborhood tabu search and its application to the median cycle problem.
• Preprocessing and cutting for multiple allocation hub location problems.
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Concentrator location in telecommunications networks.
• A branch and cut algorithm for hub location problems with single assignment
• Locating tree-shaped facilities using the ordered median objective
• Primal-dual algorithms for connected facility location problems
• Approximation algorithms for the optimal \(p\)-source communication spanning tree
• Locating median cycles in networks
• Formulating and solving splittable capacitated multiple allocation hub location problems
• A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
• Star \(p\)-hub median problem with modular arc capacities
• Network hub location problems: The state of the art
• On the capacitated concentrator location problem: a reformulation by discretization
• Metaheuristics and cooperative approaches for the bi-objective ring star problem
• The Truck Dispatching Problem
• Benders Decomposition for Large-Scale Uncapacitated Hub Location
• Dual-Based Local Search for the Connected Facility Location and Related Problems
• Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
• Minimax flow tree problems
• Hub Arc Location Problems: Part I—Introduction and Results
• Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
• Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
• On locating path- or tree-shaped facilities on networks
• Optimum Communication Spanning Trees
• Fixed-cost transportation problems
• On the Complexity of Some Common Geometric Location Problems
• Approximation Algorithms for Problems Combining Facility Location and Network Design
• Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
• The Capacitated m-Ring-Star Problem
• Locational analysis: highlights of growth to maturity
• Locating a cycle in a transportation or a telecommunications network
• Steiner problem in networks: A survey
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• The generalized P‐forest problem on a tree network
• P-Complete Approximation Problems
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• A hub location problem in designing digital data service networks: Lagrangian relaxation approach
• The Covering Tour Problem
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
• Efficient heuristics for Median Cycle Problems
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• Provisioning a virtual private network
• A Benders Decomposition for Hub Location Problems Arising in Public Transport
• Solving the hub location problem in a star–star network
• Upgrading arcs to minimize the maximum travel time in a network
• Network design for time‐constrained delivery
• Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
• Maximum matching and a polyhedron with 0,1-vertices
• The Location of Emergency Service Facilities
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Capacitated facility location/network design problems.
• A comparison of Steiner tree relaxations

This page was built for publication: General network design: a unified view of combined location and network design problems