Pages that link to "Item:Q4720806"
From MaRDI portal
The following pages link to On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem (Q4720806):
Displaying 50 items.
- One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
- New algorithms for facility location problems on the real line (Q517797) (← links)
- Computing the geodesic center of a simple polygon (Q582099) (← links)
- Weighted search in the plane (Q673472) (← links)
- Algorithms for weak and wide separation of sets (Q686422) (← links)
- Linear time algorithms for some separable quadratic programming problems (Q688207) (← links)
- A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes (Q689920) (← links)
- A simple heuristic for the p-centre problem (Q761233) (← links)
- Improved algorithms for the bichromatic two-center problem for pairs of points (Q824325) (← links)
- Multi-dimensional dynamic facility location and fast computation at query points (Q976128) (← links)
- A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane (Q1007585) (← links)
- On the detection of a common intersection of k convex subjects in the plane (Q1111021) (← links)
- Convex hulls of samples from spherically symmetric distributions (Q1175782) (← links)
- Small-dimensional linear programming and convex hulls made easy (Q1176319) (← links)
- Transitions in geometric minimum spanning trees (Q1199130) (← links)
- On the ball spanned by balls (Q1264087) (← links)
- K-center and K-median problems in graded distances (Q1274996) (← links)
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth (Q1278042) (← links)
- Calculating a minimal sphere containing a polytope defined by a system of linear inequalities (Q1326513) (← links)
- Optimal algorithms for some intersection radius problems (Q1332347) (← links)
- Helly-type theorems and generalized linear programming (Q1338955) (← links)
- Decomposable multi-parameter matroid optimization problems. (Q1401298) (← links)
- Application of decision analysis techniques to the Weber facility location problem (Q1610127) (← links)
- Facility location problems with uncertainty on the plane (Q1779686) (← links)
- A randomized algorithm for fixed-dimensional linear programming (Q1823854) (← links)
- Building bridges between convex regions (Q1873160) (← links)
- Fuzzy disk for covering fuzzy points (Q1887918) (← links)
- Separation and approximation of polyhedral objects (Q1900992) (← links)
- A subexponential bound for linear programming (Q1923862) (← links)
- Linear programming in \(O(n\times 3^{d^2})\) time (Q2003407) (← links)
- Covering problems with polyellipsoids: a location analysis perspective (Q2028797) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints (Q2181246) (← links)
- Bichromatic 2-center of pairs of points (Q2261579) (← links)
- Computing a geodesic two-center of points in a simple polygon (Q2331214) (← links)
- On the planar piecewise quadratic 1-center problem (Q2379920) (← links)
- A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
- Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities (Q2494476) (← links)
- The \(p\)-center problem under locational uncertainty of demand points (Q2688470) (← links)
- CONSTRAINED OPTIMAL LOCATION (Q2748922) (← links)
- Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints (Q2795940) (← links)
- An algorithm and a core set result for the weighted Euclidean one-center problem (Q2899026) (← links)
- On the 2-Center Problem Under Convex Polyhedral Distance Function (Q2958331) (← links)
- (Q3404171) (← links)
- Solving Linear Programming with Constraints Unknown (Q3448779) (← links)
- Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function (Q4632168) (← links)
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS (Q4818546) (← links)
- ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS (Q4931731) (← links)
- Two-variable linear programming in parallel (Q5054853) (← links)
