Pages that link to "Item:Q3315272"
From MaRDI portal
The following pages link to Linear Time Algorithms for Two- and Three-Variable Linear Programs (Q3315272):
Displaying 50 items.
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446) (← links)
- Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
- Outlier respecting points approximation (Q517798) (← links)
- On simplex method with most-obtuse-angle rule and cosine rule (Q548344) (← links)
- Computing the geodesic center of a simple polygon (Q582099) (← links)
- A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times (Q617517) (← links)
- The minmax regret gradual covering location problem on a network with incomplete information of demand weights (Q621687) (← links)
- Geometric orderings of intersecting translates and their applications (Q676584) (← links)
- The double pivot simplex method (Q684156) (← links)
- Open questions in complexity theory for numerical optimization (Q687097) (← links)
- Minimax regret 1-median problem in dynamic path networks (Q726099) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- Computing shortest transversals (Q757096) (← links)
- On the angle restricted nearest neighbor problem (Q910232) (← links)
- An optimal parallel algorithm for linear programming in the plane (Q915450) (← links)
- Algorithms for high dimensional stabbing problems (Q916570) (← links)
- A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case (Q1003678) (← links)
- A linear programming approach to highly precise clock synchronization over a packet network (Q1029567) (← links)
- Computing circular separability (Q1079817) (← links)
- Minimum polygonal separation (Q1101685) (← links)
- Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon (Q1102184) (← links)
- On the detection of a common intersection of k convex subjects in the plane (Q1111021) (← links)
- Group centre and group median of a network (Q1123113) (← links)
- Small-dimensional linear programming and convex hulls made easy (Q1176319) (← links)
- Finding effective ``Force targets'' for two-dimensional, multifinger frictional grips (Q1188112) (← links)
- On Anstreicher's combined phase I-phase II projective algorithm for linear programming (Q1194852) (← links)
- Seven fingers allow force-torque closure grasps on any convex polyhedron (Q1209736) (← links)
- Cutting hyperplanes for divide-and-conquer (Q1209837) (← links)
- On the ball spanned by balls (Q1264087) (← links)
- Robust economic order quantity models (Q1278127) (← links)
- Locational optimization problems solved through Voronoi diagrams (Q1278720) (← links)
- A geometrical solution for quadratic bicriteria location models (Q1296369) (← links)
- Optimal algorithms for some intersection radius problems (Q1332347) (← links)
- Derandomizing an output-sensitive convex hull algorithm in three dimensions (Q1346251) (← links)
- Algorithms for the robust 1-center problem on a tree (Q1569932) (← links)
- Constructing the convex hull of a partially sorted set of points (Q1803271) (← links)
- A randomized algorithm for fixed-dimensional linear programming (Q1823854) (← links)
- On computing the closest boundary point on the convex hull (Q1824383) (← links)
- Efficient algorithm for transversal of disjoint convex polygons. (Q1853055) (← links)
- Transversal of disjoint convex polygons. (Q1853175) (← links)
- A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks (Q1885943) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- \(\varepsilon\)-approximation minimization of convex functions in fixed dimension (Q1919184) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- Scheduling with a common due-window: polynomially solvable cases (Q2269806) (← links)
- Linear updates for a single-phase projective method (Q2276876) (← links)
- Assigning weights to minimize the covering radius in the plane (Q2331208) (← links)
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points (Q2365326) (← links)
- Approximating points by a piecewise linear function (Q2375945) (← links)
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs (Q2490167) (← links)
