An algorithm for the minimax Weber problem
type: Item
instance of: scholarly article
title: An algorithm for the minimax Weber problem
zbMATH Open document ID: 0452.90024
DOI: 10.1016/0377-2217(81)90200-9
published in: European Journal of Operational Research
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3708075
zbMATH Keywords: minimax Weber problem
zbMATH Keywords: logistics
zbMATH Keywords: minimax location
zbMATH Keywords: weighted absolute center
zbMATH Keywords: Euclidean plane
zbMATH Keywords: algorithm
zbMATH Keywords: implementation
zbMATH Keywords: method of feasible directions
zbMATH Keywords: proof of convergence
zbMATH Keywords: computational experience
zbMATH Keywords: FORTRAN
author: Soren Kruse Jacobsen
MaRDI profile type: Publication
full work available at URL: 0377-2217(81)90200-9
OpenAlex ID: W1985025885
Wikidata QID: Q29395444
cites work: An Efficient Method to Solve the Minimax Problem Directly
cites work: Q3316922
cites work: An approach to nonlinear programming
cites work: Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria
description: scientific article; zbMATH DE number 3708075