Pages that link to "Item:Q1104865"
From MaRDI portal
The following pages link to The algebraic degree of geometric optimization problems (Q1104865):
Displayed 21 items.
- The Fermat-Torricelli problem. I: A discrete gradient-method approach (Q368737) (← links)
- The projection median of a set of points in \({\mathbb{R}}^{d}\) (Q664356) (← links)
- On stars and Steiner stars (Q834191) (← links)
- The algebraic degree of semidefinite programming (Q847857) (← links)
- Largest and smallest convex hulls for imprecise points (Q848964) (← links)
- On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours (Q924547) (← links)
- Generalized median graph computation by means of graph embedding in vector spaces (Q962746) (← links)
- Improved bounds on the average distance to the Fermat-Weber center of a convex object (Q976108) (← links)
- The projection median of a set of points (Q1025289) (← links)
- Single facility collection depots location problem in the plane (Q1025297) (← links)
- Power-aware scheduling for makespan and flow (Q1041350) (← links)
- Geometric optimization and \(D^ P\)-completeness (Q1106665) (← links)
- The dynamics and internal geometry of the three-city noxious location problem (Q1310194) (← links)
- The Fermat-Torricelli point and isosceles tetrahedra (Q1321697) (← links)
- Facility location problems with uncertainty on the plane (Q1779686) (← links)
- Fast approximations for sums of distances, clustering and the Fermat-Weber problem (Q1869747) (← links)
- An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841) (← links)
- Similarity of polygonal curves in the presence of outliers (Q2444314) (← links)
- On the Fermat-Weber center of a convex object (Q2571212) (← links)
- Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance (Q3183457) (← links)
- SMOOTHING IMPRECISE 1.5D TERRAINS (Q4931729) (← links)