Analyzing tradeoffs between zonal constraints and accessibility in facility location
From MaRDI portal
Publication:1317094
DOI10.1016/0305-0548(94)90064-7zbMath0789.90048OpenAlexW2016912482MaRDI QIDQ1317094
Ross A. Gerrard, Richard L. Church
Publication date: 14 June 1994
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90064-7
Lagrangian relaxation\(p\)-median problemconstrained multiobjective modelzonally constrained median problem
Related Items (3)
Solving the anti-covering location problem using Lagrangian relaxation ⋮ Advanced network connectivity features and zonal requirements in covering location problems ⋮ Dual-based approach for a hub network design problem under non-restrictive policy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The zone-constrained location problem on a network
- A comparison of two dual-based procedures for solving the p-median problem
- Multiobjective programming and planning
- A tree search algorithm for the p-median problem
- Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
- A restricted Lagrangean approach to the traveling salesman problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Technical Note—An Algorithm for the p-Median Problem
- Validation of subgradient optimization
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Analyzing tradeoffs between zonal constraints and accessibility in facility location
