A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints

DOI10.1287/IJOC.2020.1006MaRDI QIDQ5085487zbMATH OpenOpenAlexFDO

Authors Zeyang Wu, Kameng Nip, Qie He

Publication date 27 June 2022

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.2020.1006

zbMATH Keywords

resource allocationpolynomial-time algorithmsdivide and conquerconstraint relaxationmixed integer convex optimization

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Recommendations

• A decomposition algorithm for nested resource allocation problems
• A fast algorithm for quadratic resource allocation problems with nested constraints
• Separable convex resource allocation problem with \(L_1\)-distance constraint
• Algorithms for separable nonlinear resource allocation problems
• A convex programming with nested constraints on the amount of resources
• A faster algorithm for the resource allocation problem with convex cost functions
• An algorithm for resource allocation with constraints in an input-output framework
• A breakpoint search approach for convex resource allocation problems with bounded variables
• A new approximation technique for resource-allocation problems
• Solving nested-constraint resource allocation problems with an interior point method

Cites work

• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• scientific article; zbMATH DE number 544186 (Why is no real title available?)
• A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
• A Joint Vehicle Routing and Speed Optimization Problem
• A branch and bound algorithm for solving the multiple-choice knapsack problem
• A decomposition algorithm for nested resource allocation problems
• A matheuristic approach for the pollution-routing problem
• A survey on the continuous nonlinear resource allocation problem
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
• An O(n) algorithm for quadratic knapsack problems
• An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
• Introduction to algorithms.
• Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
• On the Two Different Aspects of the Representative Method: The Method of Stratified Sampling and the Method of Purposive Selection
• Optimal Flows in Networks with Multiple Sources and Sinks, with Applications to Oil and Gas Lease Investment Programs
• PERT and crashing revisited: Mathematical generalizations
• Reformulations for utilizing separability when solving convex MINLP problems
• Resource allocation problems in decentralized energy management
• Support Vector Ordinal Regression
• TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time
• The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• The optimum distribution of effort
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region

Cited in

(3)

• A fast algorithm for quadratic resource allocation problems with nested constraints
• A convex programming with nested constraints on the amount of resources
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions

Describes a project that uses

Uses Software

• Gurobi

This page was built for publication: A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints

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