scientific article; zbMATH DE number 1423921
From MaRDI portal
Publication:4945109
zbMath0953.90033MaRDI QIDQ4945109
No author found.
Publication date: 30 January 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (13)
Minisum location problem with farthest Euclidean distances ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ Locating an axis-parallel rectangle on a Manhattan plane ⋮ An algorithm for generalized constrained multi-source Weber problem with demand substations ⋮ A biobjective approach to recoverable robustness based on location planning ⋮ Continuous location model of a rectangular barrier facility ⋮ On the structure of the solution set for the single facility location problem with average distances ⋮ Locating facilities by minimax relative to closest points of demand areas ⋮ Supply facility and input/output point locations in the presence of barriers ⋮ Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances ⋮ A minisum location problem with regional demand considering farthest Euclidean distances ⋮ The single facility location problem with average-distances ⋮ A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
This page was built for publication:
