Minimum variance allocation among constrained intervals

DOI10.1007/s10898-019-00748-3zbMath1422.91394OpenAlexW2914338327WikidataQ128490390 ScholiaQ128490390MaRDI QIDQ2423792

Hsin-Min Sun, Ruey-Lin Sheu

Publication date: 20 June 2019

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-019-00748-3

zbMATH Keywords

quadratic knapsack problemresource distributionsingly constrained quadratic programseparable convex programming

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

Variable fixing method by weighted average for the continuous quadratic knapsack problem

Uses Software

• NAPHEAP

Cites Work

• Unnamed Item
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
• An O(n) algorithm for quadratic knapsack problems
• Algorithms for the solution of quadratic knapsack problems
• A Newton's method for the continuous quadratic knapsack problem
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• Variable fixing algorithms for the continuous quadratic Knapsack problem
• Time bounds for selection
• A survey on the continuous nonlinear resource allocation problem
• Breakpoint searching algorithms for the continuous quadratic knapsack problem
• On linear-time algorithms for the continuous quadratic Knapsack problem
• New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
• Quasi-Newton Updates with Bounds
• A polynomially bounded algorithm for a singly constrained quadratic program
• An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem

This page was built for publication: Minimum variance allocation among constrained intervals