Quadratic resource allocation with generalized upper bounds

DOI10.1016/S0167-6377(96)00039-9zbMath0890.90149OpenAlexW2046881509WikidataQ126459858 ScholiaQ126459858MaRDI QIDQ1376263

Bala Shetty, Kurt M. Bretthauer

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

zbMATH Keywords

large-scale problemsgeneralized upper boundquadratic knapsack subproblemsquadratic resource allocation

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Discrete location and assignment (90B80)

Related Items (17)

Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications ⋮ Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ A penalty algorithm for solving convex separable knapsack problems ⋮ A Newton's method for the continuous quadratic knapsack problem ⋮ Quantized event-triggered communication based multi-agent system for distributed resource allocation optimization ⋮ Distributed optimal resource allocation with second‐order multi‐Agent systems ⋮ The symmetric quadratic knapsack problem: approximation and scheduling applications ⋮ Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints ⋮ Variable fixing algorithms for the continuous quadratic Knapsack problem ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Breakpoint searching algorithms for the continuous quadratic knapsack problem ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem ⋮ A pegging algorithm for the nonlinear resource allocation problem ⋮ Variable fixing method by weighted average for the continuous quadratic knapsack problem ⋮ Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem ⋮ The nonlinear knapsack problem - algorithms and applications ⋮ An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem

Uses Software

• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch and search algorithm for a class of nonlinear knapsack problems
• 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
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
• 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
• A polynomially bounded algorithm for a singly constrained quadratic program
• Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
• Solution techniques for some allocation problems
• Solving Large Sparse Nonlinear Programs Using GRG
• Massively Parallel Algorithms for Singly Constrained Convex Programs
• Technical Note—Allocation of Effort Resources among Competing Activities
• A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem

This page was built for publication: Quadratic resource allocation with generalized upper bounds