An O(n) algorithm for the linear multiple choice knapsack problem and related problems
Information Processing Letters
Linear programming in O(n × 3d2) time
Information Processing Letters
On a multidimensional search technique and its application to the Euclidean one centre problem
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Resource allocation problems: algorithmic approaches
Resource allocation problems: algorithmic approaches
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Review of recent development: An O( n) algorithm for quadratic knapsack problems
Operations Research Letters
Hybrid rounding techniques for knapsack problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
Operations Research Letters
Quadratic resource allocation with generalized upper bounds
Operations Research Letters
Maximizing circle of trust in online social networks
Proceedings of the 23rd ACM conference on Hypertext and social media
| Hi-index | 0.00 |
A large class of separable quadratic programming problems is presented. The problems in the class can be solved in linear time. The class includes the separable convex quadratic transportation problem with a fixed number of sources and separable convex quadratic programming with nonnegativity constraints and a fixed number of linear equality constraints.