A maximum \(L_p\) distance problem
type: Item
instance of: scholarly article
title: A maximum \(L_p\) distance problem
zbMATH Open document ID: 0894.90098
author: Emanuel Melachrinoudis
author: Zaharias Xanthopulos
published in: Journal of Mathematical Analysis and Applications
publication date: 1998-09-13T00:00:00Z
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1115491
zbMATH Keywords: generalized \(L_p\) norm
zbMATH Keywords: nonlinear and nonconvex problem
zbMATH Keywords: subdivision procedure
zbMATH Keywords: enveloping procedure
MaRDI profile type: Publication
full work available at URL: jmaa.1997.5748
OpenAlex ID: W43370362
cites work: Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
cites work: An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
cites work: Q5749144
cites work: The Minisum and Minimax Location Problems Revisited
cites work: Q5812325
cites work: Modelling Inter-city Road Distances by Mathematical Functions
cites work: Mathematical Models of Road Travel Distances
cites work: Q4203976
cites work: An analytical solution to the minimum \(L_ p\)-norm of a hyperplane
cites work: Finding the Point of a Polyhedron Closest to the Origin
cites work: Q4361347
cites work: Finding the closest point to the origin in the convex hull of a discrete set of points
cites work: Finding the nearest point in A polytope
DOI: 10.1006/JMAA.1997.5748
description: scientific article; zbMATH DE number 1115491