Properties and Solution Methods for Large Location-Allocation Problems

From MaRDI portal
Publication:3936462

DOI10.2307/2581663zbMath0478.90017OpenAlexW4233706711MaRDI QIDQ3936462

Love, Robert F., Henrik Juel

Publication date: 1982

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2581663




Related Items (20)

A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problemA projection method for \(l_ p\) norm location-allocation problemsDuality in constrained location problemsDuality in constrained multi‐facility location modelsLocation and layout planning. A surveyComparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problemsSolving the planar \(p\)-Median problem by variable neighborhood and concentric searchesA two-echelon joint continuous-discrete location modelLocation Science in CanadaA new bounding method for single facility location modelsSelf-organizing feature maps for solving location--allocation problems with rectilinear distances.The multiple-robot assembly plan problemA multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demandAllocation search methods for a generalized class of location-allocation problemsContour approximation of data: a duality theoryDetermining dominant wind directionsSolving probabilistic multi-facility Weber problem by vector quantizationKohonen maps for solving a class of location-allocation problemsMetaheuristic applications on discrete facility location problems: a surveyAn efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem




This page was built for publication: Properties and Solution Methods for Large Location-Allocation Problems