A method of Euclidean centers
type: Item
instance of: scholarly article
title: A method of Euclidean centers
zbMATH Open document ID: 0844.90053
DOI: 10.1016/0305-0548(95)00010-J
author: James T. Fagan
author: James E. Falk
published in: Computers \& Operations Research
publication date: 1996-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 838675
zbMATH Keywords: Euclidean center
zbMATH Keywords: radius of the maximal inscribed hypersphere
zbMATH Keywords: method of steepest ascent
MaRDI profile type: Publication
cites work: A new polynomial-time algorithm for linear programming
cites work: Q5611526
cites work: Q4016509
cites work: Q5588268
cites work: Q5540119
cites work: Q3677502
cites work: Q4942388
cites work: Convex Analysis
cites work: Q3690974
cites work: Q5566063
cites work: Q5514145
cites work: Finding the closest point to the origin in the convex hull of a discrete set of points
cites work: The Simplex Method for Quadratic Programming
cites work: Polytope pairs and their relationship to linear programming
full work available at URL: 0305-0548(95)00010-j
OpenAlex ID: W2085755656
Recommended article: A version of the parameterized method of centers
Recommended article: Euclidean centers: Computation, properties and a MOLP application
Recommended article: A geometric centroid principle and its application
Recommended article: Some properties of methods of centers
Recommended article: Weighted Euclidean centers
Recommended article: The center problem via averaging method
Recommended article: The optimality of the centroid method
Recommended article: Q3827797
description: scientific article; zbMATH DE number 838675