General network design: a unified view of combined location and network design problems
type: Item
instance of: scholarly article
title: General network design: a unified view of combined location and network design problems
zbMATH Open document ID: 1253.90058
author: Elena Fernández
author: Ivan Contreras
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6119322
zbMATH Keywords: network location
zbMATH Keywords: network design
zbMATH Keywords: network routing
zbMATH Keywords: location
MaRDI profile type: Publication
full work available at URL: j.ejor.2011.11.009
OpenAlex ID: W2015646948
cites work: Q3056948
cites work: Network hub location problems: The state of the art
cites work: Q4398375
cites work: A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
cites work: The Capacitated m-Ring-Star Problem
cites work: Fixed-cost transportation problems
cites work: Dual-based local search for the connected facility location and related problems
cites work: A Branch-and-Cut method for the Capacitated Location-Routing Problem
cites work: Preprocessing and cutting for multiple allocation hub location problems.
cites work: Integer programming formulations of discrete hub location problems
cites work: Q3147668
cites work: Hub Arc Location Problems: Part I—Introduction and Results
cites work: Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
cites work: Upgrading arcs to minimize the maximum travel time in a network
cites work: A branch-and-cut algorithm for the partitioning-hub location-routing problem
cites work: Network design for time‐constrained delivery
cites work: Minimax flow tree problems
cites work: Q3394446
cites work: Q3416579
cites work: Benders decomposition for large-scale uncapacitated hub location
cites work: Branch and price for large-scale capacitated hub location problems with single assignment
cites work: Stochastic uncapacitated hub location
cites work: Lagrangean relaxation for the capacitated hub location problem with single assignment
cites work: Tight bounds from a path based formulation for the tree of hub location problem
cites work: The tree of hubs location problem
cites work: Lagrangean bounds for the optimum communication spanning tree problem
cites work: An integrated model for logistics network design
cites work: Q3351135
cites work: The capacitated single-allocation hub location problem revisited: a note on a classical formulation
cites work: Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
cites work: The median tour and maximal covering tour problems: Formulations and heuristics
cites work: The truck dispatching problem
cites work: A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
cites work: The capacitated multiple allocation hub location problem: Formulations and algorithms
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Q3579459
cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem
cites work: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
cites work: An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
cites work: Solution algorithms for the capacitated single allocation hub location problem
cites work: 0-1 reformulations of the multicommodity capacitated network design problem
cites work: The Covering Tour Problem
cites work: A Benders Decomposition for Hub Location Problems Arising in Public Transport
cites work: MIP models for connected facility location: a theoretical and computational study
cites work: On the capacitated concentrator location problem: a reformulation by discretization
cites work: Provisioning a virtual private network
cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
cites work: On locating path- or tree-shaped facilities on networks
cites work: Adapting polyhedral properties from facility to hub location problems
cites work: Optimum Communication Spanning Trees
cites work: Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
cites work: Q5838558
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: Q5689811
cites work: Q4955272
cites work: The Ring Star Problem: Polyhedral analysis and exact algorithm
cites work: Locating median cycles in networks
cites work: A branch and cut algorithm for hub location problems with single assignment
cites work: Polyhedral analysis for concentrator location problems
cites work: Solving the hub location problem in a star–star network
cites work: Locating a cycle in a transportation or a telecommunications network
cites work: A hub location problem in designing digital data service networks: Lagrangian relaxation approach

General network design: a unified view of combined location and network design problems (cites work)
cites work: Metaheuristics and cooperative approaches for the bi-objective ring star problem

General network design: a unified view of combined location and network design problems (cites work)
cites work: Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm

General network design: a unified view of combined location and network design problems (cites work)
cites work: Formulating and solving splittable capacitated multiple allocation hub location problems

General network design: a unified view of combined location and network design problems (cites work)
cites work: New formulations for the uncapacitated multiple allocation hub location problem

General network design: a unified view of combined location and network design problems (cites work)
cites work: An extension to rapid transit network design problem

General network design: a unified view of combined location and network design problems (cites work)
cites work: On the Complexity of Some Common Geometric Location Problems

General network design: a unified view of combined location and network design problems (cites work)
cites work: Capacitated facility location/network design problems.

General network design: a unified view of combined location and network design problems (cites work)
cites work: Facility location and supply chain management. A review

General network design: a unified view of combined location and network design problems (cites work)
cites work: A review of extensive facility location in networks

General network design: a unified view of combined location and network design problems (cites work)
cites work: Networks synthesis and optimum network design problems: Models, solution methods and applications

General network design: a unified view of combined location and network design problems (cites work)
cites work: Variable neighborhood tabu search and its application to the median cycle problem.

General network design: a unified view of combined location and network design problems (cites work)
cites work: Location-routing: issues, models and methods

General network design: a unified view of combined location and network design problems (cites work)
cites work: A comparison of Steiner tree relaxations

General network design: a unified view of combined location and network design problems (cites work)
cites work: Locating tree-shaped facilities using the ordered median objective

General network design: a unified view of combined location and network design problems (cites work)
cites work: Approximation Algorithms for Problems Combining Facility Location and Network Design

General network design: a unified view of combined location and network design problems (cites work)
cites work: Efficient heuristics for Median Cycle Problems

General network design: a unified view of combined location and network design problems (cites work)
cites work: P-Complete Approximation Problems

General network design: a unified view of combined location and network design problems (cites work)
cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems

General network design: a unified view of combined location and network design problems (cites work)
cites work: Locational analysis: highlights of growth to maturity

General network design: a unified view of combined location and network design problems (cites work)
cites work: Primal-dual algorithms for connected facility location problems

General network design: a unified view of combined location and network design problems (cites work)
cites work: The generalized P‐forest problem on a tree network

General network design: a unified view of combined location and network design problems (cites work)
cites work: The Location of Emergency Service Facilities

General network design: a unified view of combined location and network design problems (cites work)
cites work: A simpler and better derandomization of an approximation algorithm for single source rent-or-buy

General network design: a unified view of combined location and network design problems (cites work)
cites work: Steiner problem in networks: A survey

General network design: a unified view of combined location and network design problems (cites work)
cites work: Approximation algorithms for the optimal \(p\)-source communication spanning tree

General network design: a unified view of combined location and network design problems (cites work)
cites work: Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search

General network design: a unified view of combined location and network design problems (cites work)
cites work: Concentrator location in telecommunications networks.

General network design: a unified view of combined location and network design problems (cites work)
cites work: Star \(p\)-hub median problem with modular arc capacities

General network design: a unified view of combined location and network design problems (DOI)
DOI: 10.1016/J.EJOR.2011.11.009