A Cut Approach to the Rectilinear Distance Facility Location Problem

DOI10.1287/opre.26.3.422zbMath0381.90090OpenAlexW2035033483MaRDI QIDQ4161098

H. Donald Ratliff, Jean-Claude Picard

Publication date: 1978

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.26.3.422

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Operations research and management science (90B99)

Related Items (27)

Layout of facilities with some fixed points ⋮ Imprecise weights in Weber facility location problem ⋮ Sufficient conditions for coincidence in \(\ell_ 1\)-minisum multifacility location problems ⋮ A multifacility location problem on median spaces ⋮ Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones ⋮ Optimization of location of interconnected facilities on parallel lines with forbidden zones ⋮ The impact of distance on location problems ⋮ Unnamed Item ⋮ Duality for constrained multifacility location problems with mixed norms and applications ⋮ A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location ⋮ Locational analysis ⋮ The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds ⋮ A fast algorithm for the generalized parametric minimum cut problem and applications ⋮ Transitions in geometric minimum spanning trees ⋮ Local convergence in a generalized Fermat-Weber problem ⋮ Locating facilities which interact: Some solvable cases ⋮ On solving unreliable planar location problems ⋮ An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree ⋮ Pseudo-Boolean optimization ⋮ An integrated approach for the concurrent determination of the block layout and the input and output point locations based on the contour distance ⋮ An integrated approach to determine the block layout, AGV flow path and the location of pick-up/delivery points in single-loop systems ⋮ Discrete convexity and polynomial solvability in minimum 0-extension problems ⋮ One-dimensional machine location problems in a multi-product flowline with equidistant locations ⋮ Complexity results for the \(p\)-median problem with mutual communication ⋮ Approximation algorithms for maximum linear arrangement ⋮ A faster parametric minimum-cut algorithm ⋮ The least element property of center location on tree networks with applications to distance and precedence constrained problems

This page was built for publication: A Cut Approach to the Rectilinear Distance Facility Location Problem