The multi-facility min-max Weber problem
From MaRDI portal
Recommendations
- Two algorithms for the multi-Weber problem
- An optimal method for solving the (generalized) multi-Weber problem
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
- Bicriteria and restricted 2-facility Weber problems
- New heuristic methods for the capacitated multi-facility Weber problem
Cites work
- scientific article; zbMATH DE number 3127495 (Why is no real title available?)
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- An Analysis of Private and Public Sector Location Models
- An algorithm for the minimax Weber problem
- Chromatic Scheduling and the Chromatic Number Problem
- Constrained Location and the Weber-Rawls Problem
- Single Facility $l_p $-Distance Minimax Location
- The Solution of Distance Constrained Mini-Sum Location Problems
Cited in
(8)- Multi-facility green Weber problem
- Two algorithms for the multi-Weber problem
- The maximin line problem with regional demand
- The Solution of Distance Constrained Mini-Sum Location Problems
- The multifacility center problems with random demand weights
- The Weber Problem in a Multi-Storey Building
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
- scientific article; zbMATH DE number 4074780 (Why is no real title available?)
This page was built for publication: The multi-facility min-max Weber problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795710)
