Pages that link to "Item:Q1099951"
From MaRDI portal
The following pages link to Geometric complexity of some location problems (Q1099951):
Displaying 48 items.
- Minimum-area enclosing triangle with a fixed angle (Q390370) (← links)
- The class cover problem with boxes (Q419500) (← links)
- One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
- New algorithms for facility location problems on the real line (Q517797) (← links)
- Fitting a two-joint orthogonal chain to a point set (Q617541) (← links)
- Planar expropriation problem with non-rigid rectangular facilities (Q709112) (← links)
- The maximin line problem with regional demand (Q872234) (← links)
- 2-Covered paths by a set of antennas with minimum power transmission range (Q989482) (← links)
- Facility location problems in the plane based on reverse nearest neighbor queries (Q1038383) (← links)
- Obtaining lower bounds using artificial components (Q1107991) (← links)
- Computing the minimum Hausdorff distance between two point sets on a line under translation (Q1178208) (← links)
- An efficient parallel sorting algorithm (Q1199552) (← links)
- Locational optimization problems solved through Voronoi diagrams (Q1278720) (← links)
- Median hyperplanes in normed spaces -- a survey (Q1281394) (← links)
- Special issue on Locational analysis (Q1284594) (← links)
- Location of rectilinear center trajectories (Q1284595) (← links)
- Solving restricted line location problems via a dual interpretation (Q1289029) (← links)
- A comment on a minmax location problem (Q1306472) (← links)
- Heuristics for parallel machine scheduling with delivery times (Q1338896) (← links)
- \(k\) best cuts for circular-arc graphs (Q1355722) (← links)
- A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center (Q1405006) (← links)
- Continuous location of dimensional structures. (Q1410321) (← links)
- Computing an obnoxious anchored segment. (Q1413920) (← links)
- Sorting weighted distances with applications to objective function evaluations in single facility location problems. (Q1426729) (← links)
- A near-linear algorithm for the planar segment-center problem (Q1816414) (← links)
- On computing the closest boundary point on the convex hull (Q1824383) (← links)
- Bichromatic 2-center of pairs of points (Q2261579) (← links)
- Minimum perimeter-sum partitions in the plane (Q2291459) (← links)
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications (Q2367406) (← links)
- On the planar piecewise quadratic 1-center problem (Q2379920) (← links)
- On finding widest empty curved corridors (Q2385694) (← links)
- Minmax-distance approximation and separation problems: geometrical properties (Q2429461) (← links)
- Locating an obnoxious plane (Q2496077) (← links)
- The \(p\)-center problem under locational uncertainty of demand points (Q2688470) (← links)
- OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM (Q2708039) (← links)
- On the 2-Center Problem Under Convex Polyhedral Distance Function (Q2958331) (← links)
- PROCESSING AN OFFLINE INSERTION-QUERY SEQUENCE WITH APPLICATIONS (Q3173480) (← links)
- The (1|1)-Centroid Problem in the Plane with Distance Constraints (Q3177899) (← links)
- COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET (Q4513242) (← links)
- Linear approximation of simple objects (Q5096785) (← links)
- SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS (Q5291404) (← links)
- LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS (Q5300001) (← links)
- Processing an Offline Insertion-Query Sequence with Applications (Q5321704) (← links)
- Conditional Location Problems on Networks and in the Plane (Q5506724) (← links)
- LABELING POINTS ON A SINGLE LINE (Q5696540) (← links)
- Linear approximation of simple objects (Q5890660) (← links)
- Linear approximation of simple objects (Q5906528) (← links)
- On fixed-parameter solvability of the minimax path location problem (Q6063573) (← links)
