Linear Time Algorithms for Two- and Three-Variable Linear Programs
From MaRDI portal
Recommendations
- Linear Programming in Linear Time When the Dimension Is Fixed
- Las Vegas algorithms for linear and integer programming when the dimension is small
- scientific article; zbMATH DE number 1182931
- Linear Programming with Two Variables Per Inequality in Poly-Log Time
- Small-dimensional linear programming and convex hulls made easy
Cited in
(68)- Transversal of disjoint convex polygons.
- Open questions in complexity theory for numerical optimization
- Solving related two- and three-dimensional linear programming problems in logarithmic time
- The double pivot simplex method
- Robust economic order quantity models
- Two-variable linear programming in parallel
- Minimum polygonal separation
- On the angle restricted nearest neighbor problem
- Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming
- Derandomizing an output-sensitive convex hull algorithm in three dimensions
- Assigning weights to minimize the covering radius in the plane
- A randomized algorithm for fixed-dimensional linear programming
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- Finding effective ``Force targets for two-dimensional, multifinger frictional grips
- Efficient algorithms for the one-dimensional \(k\)-center problem
- Robust location problems with pos/neg weights on a tree
- Constructing the convex hull of a partially sorted set of points
- Approximating points by a piecewise linear function
- On Anstreicher's combined phase I-phase II projective algorithm for linear programming
- Free-form surface partition in 3-d
- The Location of Undesirable Facilities
- Group centre and group median of a network
- A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
- Locational optimization problems solved through Voronoi diagrams
- A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks
- Cutting hyperplanes for divide-and-conquer
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
- Sparktope: linear programs from algorithms
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\)
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
- Optimization with additional variables and constraints
- Efficient algorithms for Lipschitz selections of set-valued mappings in \(\mathbf{R} 2\)
- A geometrical solution for quadratic bicriteria location models
- The geodesic edge center of a simple polygon
- Linear Programming with Two Variables Per Inequality in Poly-Log Time
- Computing shortest transversals
- A linear programming approach to highly precise clock synchronization over a packet network
- On simplex method with most-obtuse-angle rule and cosine rule
- An optimal parallel algorithm for linear programming in the plane
- The minmax regret gradual covering location problem on a network with incomplete information of demand weights
- Algorithms for the robust 1-center problem on a tree
- Algorithms for high dimensional stabbing problems
- General models in min-max planar location: Checking optimality conditions
- \(\varepsilon\)-approximation minimization of convex functions in fixed dimension
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon
- Minmax earliness-tardiness costs with unit processing time jobs
- On the detection of a common intersection of k convex subjects in the plane
- Computing circular separability
- Small-dimensional linear programming and convex hulls made easy
- On the ball spanned by balls
- A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case
- Distribution-sensitive algorithms
- Two-variable linear programming in parallel
- Optimal algorithms for some intersection radius problems
- scientific article; zbMATH DE number 1191015 (Why is no real title available?)
- Seven fingers allow force-torque closure grasps on any convex polyhedron
- Computing the geodesic center of a simple polygon
- Scheduling with a common due-window: polynomially solvable cases
- Efficient piecewise-linear function approximation using the uniform metric
- On computing the closest boundary point on the convex hull
- Outlier respecting points approximation
- Towards a Genuinely Polynomial Algorithm for Linear Programming
- Linear updates for a single-phase projective method
- Geometric orderings of intersecting translates and their applications
- Efficient algorithm for transversal of disjoint convex polygons.
This page was built for publication: Linear Time Algorithms for Two- and Three-Variable Linear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3315272)
