A maximum \(L_p\) distance problem

DOI10.1006/jmaa.1997.5748zbMath0894.90098OpenAlexW43370362MaRDI QIDQ1378646

Emanuel Melachrinoudis, Zaharias Xanthopulos

Publication date: 13 September 1998

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.1997.5748

zbMATH Keywords

subdivision procedureenveloping proceduregeneralized \(L_p\) normnonlinear and nonconvex problem

Mathematics Subject Classification ID

Continuous location (90B85) Nonlinear programming (90C30)

Related Items

The geometry of Minkowski spaces -- a survey. II.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
• Finding the closest point to the origin in the convex hull of a discrete set of points
• An analytical solution to the minimum \(L_ p\)-norm of a hyperplane
• The Minisum and Minimax Location Problems Revisited
• Mathematical Models of Road Travel Distances
• Finding the nearest point in A polytope
• Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
• Finding the Point of a Polyhedron Closest to the Origin
• Modelling Inter-city Road Distances by Mathematical Functions