Quadratic resource allocation with generalized upper bounds
DOI10.1016/S0167-6377(96)00039-9zbMATH Open0890.90149OpenAlexW2046881509WikidataQ126459858 ScholiaQ126459858MaRDI QIDQ1376263FDOQ1376263
Authors: Kurt M. Bretthauer, Bala Shetty 
Publication date: 17 December 1997
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(96)00039-9
Recommendations
large-scale problemsgeneralized upper boundquadratic knapsack subproblemsquadratic resource allocation
Quadratic programming (90C20) Large-scale problems in mathematical programming (90C06) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A polynomially bounded algorithm for a singly constrained quadratic program
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- On the continuous quadratic knapsack problem
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- A Parallel Projection for the Multicommodity Network Model
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Solution techniques for some allocation problems
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- Technical Note—Allocation of Effort Resources among Competing Activities
- Linear time algorithms for some separable quadratic programming problems
- An O(n) algorithm for quadratic knapsack problems
- Algorithms for the solution of quadratic knapsack problems
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
- A branch and search algorithm for a class of nonlinear knapsack problems
- Algorithms for the least distance problem
- A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
- Solving Large Sparse Nonlinear Programs Using GRG
Cited In (20)
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- A penalty algorithm for solving convex separable knapsack problems
- Distributed optimal resource allocation with second‐order multi‐Agent systems
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
- Distributed optimisation based on multi-agent system for resource allocation with communication time-delay
- Title not available (Why is that?)
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- Quantized event-triggered communication based multi-agent system for distributed resource allocation optimization
- A Newton's method for the continuous quadratic knapsack problem
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- A pegging algorithm for the nonlinear resource allocation problem
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
- A survey on the continuous nonlinear resource allocation problem
- The nonlinear knapsack problem - algorithms and applications
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Title not available (Why is that?)
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
Uses Software
This page was built for publication: Quadratic resource allocation with generalized upper bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376263)
