A review of extensive facility location in networks

DOI10.1016/0377-2217(95)00321-5zbMath0926.90057OpenAlexW1975600022MaRDI QIDQ1278421

T. Brian Boffey, Juan A. Mesa

Publication date: 22 February 1999

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

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00321-5

zbMATH Keywords

locationobnoxious facilityextensive facility

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (35)

A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint ⋮ Efficient algorithms for the minmax regret path center problem with length constraint on trees ⋮ Urban rapid transit network design: accelerated Benders decomposition ⋮ Exact and heuristic algorithms for the design of hub networks with multiple lines ⋮ Location-routing: issues, models and methods ⋮ The bi-objective insular traveling salesman problem with maritime and ground transportation costs ⋮ Algorithms for central-median paths with bounded length on trees ⋮ Extensive facility location problems on networks: an updated review ⋮ The nestedness property of location problems on the line ⋮ Multiobjective routing problems ⋮ General network design: a unified view of combined location and network design problems ⋮ Variable neighbourhood structures for cycle location problems ⋮ A linear time algorithm for connected \(p\)-centdian problem on block graphs ⋮ Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm ⋮ An improved algorithm for the minmax regret path center problem on trees ⋮ Sequential competitive location on networks ⋮ Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem ⋮ Modelling and solving central cycle problems with integer programming. ⋮ Comparing different metaheuristic approaches for the median path problem with bounded length ⋮ Optimization methods for the planning of rapid transit systems ⋮ Optimal design of hierarchical networks with free main path extremes ⋮ A Lagrangian relaxation approach for expansion of a highway network ⋮ Location of infrastructure in urban railway networks ⋮ Location of speed-up subnetworks ⋮ The path-variance problem on tree networks ⋮ Locating tree-shaped facilities using the ordered median objective ⋮ Range minimization problems in path-facility location on trees ⋮ The continuous and discrete path‐variance problems on trees ⋮ Insertion heuristics for central cycle problems ⋮ Extensive facility location problems on networks with equity measures ⋮ Optimal algorithms for the path/tree-shaped facility location problems in trees ⋮ Efficient solution methods for covering tree problems ⋮ Location of paths on trees with minimal eccentricity and superior section ⋮ Unnamed Item ⋮ Comments on: ``Extensive facility location problems on networks: an updated review

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equity constrained shortest path problem
• A minimum length covering subgraph of a network
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• The hierarchical network design problem
• Finding the two-core of a tree
• The location of central structures in trees
• Reducing the hierarchical network design problem
• A comparative study of heuristics for a two-level routing-location problem
• The hierarchical network design problem with transshipment facilities
• Minisum amd minimax paths of a moving facility on a network
• The median tour and maximal covering tour problems: Formulations and heuristics
• A network-based model for transporting extremely hazardous materials
• Indirect covering tree problems on spanning tree networks
• Multiobjective routing of hazardous materials in stochastic networks
• The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
• On locating path- or tree-shaped facilities on networks
• Algorithms for a Core and k-Tree Core of a Tree
• Optimal location of a path or tree on a network with cycles
• On finding the core of a tree with a specified length
• The Hierarchical Network Design Problem: A New Formulation and Solution Procedures
• Optimal routing and process scheduling for a mobile service facility
• Locating A Median Subtree On A Network
• Maximal Direct Covering Tree Problems
• A minimum-length covering subtree of a tree
• The optimal location of a path or tree in a tree network
• Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations
• The Design of a Hierarchical Transportation Network with Transshipment Facilities
• A linear algorithm for a core of a tree
• The generalized P‐forest problem on a tree network
• On a tree-shaped facility location problem of Minieka
• Proactive optimization of toxic waste transportation, location and technology
• Location Models with Routing Considerations for a Single Obnoxious Facility
• Maximal covering tree problems
• The Covering Salesman Problem
• A Multiple Route Conditional Risk Model For Transporting Hazardous Materials
• Efficient Algorithms for Solving the Shortest Covering Path Problem
• A Location Based Heuristic for General Routing Problems
• Modeling Equity of Risk in the Transportation of Hazardous Materials
• Location Of A Tree Shaped Facility In A Network

This page was built for publication: A review of extensive facility location in networks