Analyzing tradeoffs between zonal constraints and accessibility in facility location

DOI10.1016/0305-0548(94)90064-7MaRDI QIDQ1317094zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

\(p\)-median problemconstrained multiobjective modelLagrangian relaxationzonally constrained median problem

Mathematics Subject Classification ID

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

Recommendations

• The zone-constrained location problem on a network
• Some heuristic methods for solving p-median problems with a coverage constraint
• scientific article; zbMATH DE number 1253050
• Capacitated service and regional constraints in location-allocation modeling
• P-median problems with an additional constraint on the assignment variables

Cites work

• A comparison of two dual-based procedures for solving the p-median problem
• A restricted Lagrangean approach to the traveling salesman problem
• A tree search algorithm for the p-median problem
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 3724209 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• Multiobjective programming and planning
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Technical Note—An Algorithm for the p-Median Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The zone-constrained location problem on a network
• Validation of subgradient optimization

Cited in

(4)

• Solving the anti-covering location problem using Lagrangian relaxation
• Dual-based approach for a hub network design problem under non-restrictive policy
• Advanced network connectivity features and zonal requirements in covering location problems
• The zone-constrained location problem on a network

This page was built for publication: Analyzing tradeoffs between zonal constraints and accessibility in facility location

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1317094)