A breakpoint search approach for convex resource allocation problems with bounded variables (Q691476): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-011-0288-0 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-011-0288-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049225325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonlinear Resource Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonlinear knapsack problem - algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pegging algorithm for the nonlinear resource allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Projection Method for the Integer Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production and inventory management under multiple resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Newton Updates with Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource Allocation in Multisite Service Systems with Intersite Customer Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal tax depreciation lives and charges under regulatory constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomially bounded algorithm for a singly constrained quadratic program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breakpoint searching algorithms for the continuous quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Separable Nonlinear Resource Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Allocation of Effort Resources among Competing Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Massively Parallel Algorithms for Singly Constrained Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the continuous nonlinear resource allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Optimal Routing and Servive Rate Allocation in a Multiserver Queueing System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Single-Machine Completion Time Variance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Ranking Methods for Allocation of One Resource / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-011-0288-0 / rank
 
Normal rank

Latest revision as of 00:52, 10 December 2024

scientific article
Language Label Description Also known as
English
A breakpoint search approach for convex resource allocation problems with bounded variables
scientific article

    Statements

    A breakpoint search approach for convex resource allocation problems with bounded variables (English)
    0 references
    0 references
    0 references
    30 November 2012
    0 references
    multiplier search
    0 references
    pegging
    0 references

    Identifiers