Pages that link to "Item:Q495723"
From MaRDI portal
The following pages link to Minsum location extended to gauges and to convex sets (Q495723):
Displaying 16 items.
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems (Q274096) (← links)
- On Newton's method for the Fermat-Weber location problem (Q306303) (← links)
- Facility location in normed linear spaces (Q499693) (← links)
- Applications of variational analysis to a generalized Fermat-Torricelli problem (Q535073) (← links)
- On the location of the minimum point in the Euclidean distance sum problem (Q723341) (← links)
- Distances to the two and three furthest points (Q1360797) (← links)
- A generalization of the concept of distance based on the simplex inequality (Q1646650) (← links)
- Coproximinality of linear subspaces in generalized Minkowski spaces (Q2049335) (← links)
- Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186) (← links)
- Minimizing differences of convex functions with applications to facility location and clustering (Q2401517) (← links)
- A generalized Sylvester problem and a generalized Fermat-Torricelli problem (Q2850727) (← links)
- Solving a Generalized Heron Problem by Means of Convex Analysis (Q2904856) (← links)
- Orthogonality in Generalized Minkowski Spaces (Q4628613) (← links)
- Solving a continuous multifacility location problem by DC algorithms (Q5038184) (← links)
- Minkowski Geometry—Some Concepts and Recent Developments (Q5050924) (← links)
- Four-point Fermat location problems revisited. New proofs and extensions of old results (Q5427780) (← links)
