Algorithms for the least distance problem
From MaRDI portal
Cited in
(10)- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Quadratic resource allocation with generalized upper bounds
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
- A survey on the continuous nonlinear resource allocation problem
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- A pegging algorithm for the nonlinear resource allocation problem
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
This page was built for publication: Algorithms for the least distance problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2743973)
