A breakpoint search approach for convex resource allocation problems with bounded variables
type: Item
instance of: scholarly article
title: A breakpoint search approach for convex resource allocation problems with bounded variables
zbMATH Open document ID: 1262.90166
author: Anja De Waegenaere
author: Jacco L. Wielhouwer
published in: Optimization Letters
publication date: 2012-11-30T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 91B32
zbMATH DE Number: 6111725
zbMATH Keywords: multiplier search
zbMATH Keywords: pegging
MaRDI profile type: Publication
full work available at URL: s11590-011-0288-0
OpenAlex ID: W2049225325
cites work: Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
cites work: The Nonlinear Resource Allocation Problem
cites work: The nonlinear knapsack problem - algorithms and applications
cites work: A pegging algorithm for the nonlinear resource allocation problem
cites work: A Projection Method for the Integer Quadratic Knapsack Problem
cites work: Production and inventory management under multiple resource constraints
cites work: An O(n) algorithm for quadratic knapsack problems
cites work: Quasi-Newton Updates with Bounds
cites work: Resource Allocation in Multisite Service Systems with Intersite Customer Flows
cites work: Optimal tax depreciation lives and charges under regulatory constraints
cites work: A polynomially bounded algorithm for a singly constrained quadratic program
cites work: Breakpoint searching algorithms for the continuous quadratic knapsack problem
cites work: Algorithms for separable nonlinear resource allocation problems
cites work: Technical Note—Allocation of Effort Resources among Competing Activities
cites work: Massively Parallel Algorithms for Singly Constrained Convex Programs
cites work: An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
cites work: A survey on the continuous nonlinear resource allocation problem
cites work: Asymptotically Optimal Routing and Servive Rate Allocation in a Multiserver Queueing System
cites work: Minimizing Single-Machine Completion Time Variance
cites work: Simple Ranking Methods for Allocation of One Resource
DOI: 10.1007/S11590-011-0288-0
description: scientific article; zbMATH DE number 6111725