Separable convex resource allocation problem with L₁-distance constraint

MaRDI QIDQ5208430zbMATH OpenFDO

Authors Norito Minamikawa, Akiyoshi Shioura

Publication date 15 January 2020

zbMATH Keywords

discrete optimizationresource allocation problemseparable convex functionpolymatroid constraint

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Algorithms for separable nonlinear resource allocation problems
• scientific article; zbMATH DE number 1302182
• scientific article; zbMATH DE number 1547881
• Solution of some convex separable resource allocation and production planning problems with bounds on the variables
• A decomposition algorithm for nested resource allocation problems

Cited in

(4)

• Algorithms for separable nonlinear resource allocation problems
• A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
• Algorithms for separable convex optimization with linear ascending constraints
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions

This page was built for publication: Separable convex resource allocation problem with \(L_1\)-distance constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5208430)