Weighted search in the plane
From MaRDI portal
Publication:673472
Cites work
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear programming in \(O(n\times 3^{d^2})\) time
- Maximizing concave functions in fixed dimension
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- Partitioning with two lines in the plane
- Ratio combinatorial programs
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Using separation algorithms in fixed dimension
This page was built for publication: Weighted search in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673472)