Linear time algorithms for some separable quadratic programming problems
From MaRDI portal
Recommendations
- Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure
- Linear Programming in Linear Time When the Dimension Is Fixed
- An infeasible-interior-point algorithm for separable convex quadratic programming
- Fast algorithm for the quadratic knapsack problem
- Separable standard quadratic optimization problems
Cites work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 544186 (Why is no real title available?)
- scientific article; zbMATH DE number 742962 (Why is no real title available?)
- An O(n) algorithm for quadratic knapsack problems
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- An O(n) algorithm for the multiple-choice knapsack linear program
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear programming in \(O(n\times 3^{d^2})\) time
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
Cited in
(26)- A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- A faster FPTAS for knapsack problem with cardinality constraint
- A faster FPTAS for knapsack problem with cardinality constraint
- Linearizable special cases of the quadratic shortest path problem
- Approximation algorithms for knapsack problems with cardinality constraints
- Machine scheduling with restricted rejection: an application to task offloading in cloud-edge collaborative computing
- On the discrete linear quadratic minimum-time problem
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem
- Staying safe and visible via message sharing in online social networks
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems
- Complexity and algorithms for nonlinear optimization problems
- The inverse Fermat-Weber problem
- A survey on the continuous nonlinear resource allocation problem
- Minimizing the number of tardy jobs in two-machine settings with common due date
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- Order acceptance and scheduling with consideration of service level
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Minimizing the sum of the \(k\) largest functions in linear time.
- Quadratic resource allocation with generalized upper bounds
- Linear models and computational experiments for the quadratic TSP
- Optimal iterative QP and QPQC algorithms
- On a Reduction for a Class of Resource Allocation Problems
- Hybrid rounding techniques for knapsack problems
This page was built for publication: Linear time algorithms for some separable quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688207)
