A heuristic method for large-scale multi-facility location problems
From MaRDI portal
Recommendations
- Approximate solutions to large scale capacitated facility location problems
- Near-optimal solutions to large-scale facility location problems
- Heuristic cluster algorithm for multiple facility location-allocation problem
- Heuristic Methods for Location-Allocation Problems
- scientific article; zbMATH DE number 1560330
Cites work
- scientific article; zbMATH DE number 3824979 (Why is no real title available?)
- scientific article; zbMATH DE number 47593 (Why is no real title available?)
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- scientific article; zbMATH DE number 3027356 (Why is no real title available?)
- A note on Fermat's problem
- A note on accelerating the weiszfeld procedure
- Allocation of discrete demand with changing costs
- Cluster analysis and mathematical programming
- Cluster analysis. A survey
- Competitive Location on a Network
- Directional Newton methods in \(n\) variables
- Heuristic Methods for Location-Allocation Problems
- Local convergence in Fermat's problem
- On locating new facilities in a competitive environment
- On the set partitioning type formulation for the discrete location problem
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- The Newton bracketing method for convex minimization.
Cited in
(35)- A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
- Linear relaxation solution based heuristics for a class of multi-product facility location problems
- An algorithm for generalized constrained multi-source Weber problem with demand substations
- A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
- A heuristic approach to the single facility maximin location problem
- AI 2005: Advances in Artificial Intelligence
- A Multicriteria Districting Heuristic For The Aggregation Of Zones And Its Use In Computing Origin-Destination Matrices
- The Newton bracketing method for convex minimization: convergence analysis
- On the convergence of the Cooper's algorithm
- Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning
- Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
- A generalized Weiszfeld method for the multi-facility location problem
- Accelerating the convergence in the single-source and multi-source Weber problems
- An estimation algorithm using distance clustering of data.
- Acceleration of the HAP approach for the multifacility location problem
- The big cube small cube solution method for multidimensional facility location problems
- A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities
- Distributionally robust Weber problem with uncertain demand
- Metaheuristic approaches to solving large-scale Bilevel Uncapacitated Facility Location Problem with clients' preferences
- Solving multifacility Huff location models on networks using metaheuristic and exact approaches
- An effective heuristic for large-scale capacitated facility location problems
- A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
- Heuristics for a continuous multi-facility location problem with demand regions
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- scientific article; zbMATH DE number 3848936 (Why is no real title available?)
- A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation
- Solving multiple facilities location problems with separated clusters
- Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
- Optimization models for the dynamic facility location and allocation problem
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
- Heuristics for location models
- Single- and multi-objective defensive location problems on a network
- The Newton bracketing method for the minimization of convex functions subject to affine constraints
- Heuristic Methods for Location-Allocation Problems
- The optimal solution set of the multi-source Weber problem
This page was built for publication: A heuristic method for large-scale multi-facility location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1765537)
