A Cut Approach to the Rectilinear Distance Facility Location Problem
From MaRDI portal
Cited in
(28)- Layout of facilities with some fixed points
- The impact of distance on location problems
- 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
- An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree
- One-dimensional machine location problems in a multi-product flowline with equidistant locations
- Complexity results for the \(p\)-median problem with mutual communication
- A faster parametric minimum-cut algorithm
- The least element property of center location on tree networks with applications to distance and precedence constrained problems
- Sufficient conditions for coincidence in \(\ell_ 1\)-minisum multifacility location problems
- Approximation algorithms for maximum linear arrangement
- Imprecise weights in Weber facility location problem
- A multifacility location problem on median spaces
- Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones
- An integrated approach to determine the block layout, AGV flow path and the location of pick-up/delivery points in single-loop systems
- A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location
- An integrated approach for the concurrent determination of the block layout and the input and output point locations based on the contour distance
- Parameterized algorithms for zero extension and metric labelling problems
- Optimization of location of interconnected facilities on parallel lines with forbidden zones
- On solving unreliable planar location problems
- Discrete convexity and polynomial solvability in minimum 0-extension problems
- Local convergence in a generalized Fermat-Weber problem
- Locating facilities which interact: Some solvable cases
- Node coincidence in metric minimum weighted length graph embeddings
- Pseudo-Boolean optimization
- Duality for constrained multifacility location problems with mixed norms and applications
This page was built for publication: A Cut Approach to the Rectilinear Distance Facility Location Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4161098)
