The planar multifacility collection depots location problem
From MaRDI portal
Recommendations
- On the collection depots location problem
- The collection depots location problem on networks
- Minisum collection depots location problem with multiple facilities on a network
- Single facility collection depots location problem in the plane
- Planar multifacility location problems with tree structure and finite dominating sets
Cites work
- scientific article; zbMATH DE number 1803754 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- scientific article; zbMATH DE number 1195628 (Why is no real title available?)
- scientific article; zbMATH DE number 1253040 (Why is no real title available?)
- scientific article; zbMATH DE number 1292563 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- scientific article; zbMATH DE number 3027356 (Why is no real title available?)
- A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
- A Simplex Method for Function Minimization
- A new heuristic for solving the \(p\)-median problem in the plane
- A new local search for continuous location problems
- A quadratic integer program for the location of interacting hub facilities
- An efficient genetic algorithm for the \(p\)-median problem
- Asymptotic behavior of the Weber location problem on the plane
- Exact and approximate solutions to the multisource weber problem
- Generating good starting solutions for the \(p\)-median problem in the plane
- Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
- Heuristic Methods for Location-Allocation Problems
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
- Integer programming formulations of discrete hub location problems
- Location-Allocation Problems
- Minisum collection depots location problem with multiple facilities on a network
- New heuristic algorithms for solving the planar p-median problem
- New local searches for solving the multi-source Weber problem
- On the collection depots location problem
- One-way and round-trip center location problems
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- The Weber obnoxious facility location model: a big arc small arc approach
- The collection depots location problem on networks
- The facility and transfer points location problem
- The fortified Weiszfeld algorithm for solving the Weber problem
- The multiple location of transfer points
- The transfer point location problem
- Tight linear programming relaxations of uncapacitated p-hub median problems
- Two algorithms for constructing a Delaunay triangulation
- Variable neighborhood search
- Variable neighborhood search for the p-median
Cited in
(7)- The collection depots location problem on networks
- Minisum collection depots location problem with multiple facilities on a network
- On the collection depots location problem
- The obnoxious facilities planar \(p\)-median problem
- Single facility collection depots location problem in the plane
- Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles
- Improved starting solutions for the planar p-median problem
This page was built for publication: The planar multifacility collection depots location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1628125)
