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

DOI10.1287/ijoc.2020.1006OpenAlexW3118849442MaRDI QIDQ5085487

Kameng Nip, Qie He, Zeyang Wu

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)

Related Items (1)

A fast algorithm for quadratic resource allocation problems with nested constraints

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Support Vector Ordinal Regression
• A matheuristic approach for the pollution-routing problem
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
• Reformulations for utilizing separability when solving convex MINLP problems
• A branch and bound algorithm for solving the multiple-choice knapsack problem
• An O(n) algorithm for quadratic knapsack problems
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• Resource allocation problems in decentralized energy management
• PERT and crashing revisited: Mathematical generalizations
• A survey on the continuous nonlinear resource allocation problem
• A Decomposition Algorithm for Nested Resource Allocation Problems
• An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
• TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time
• Optimal Flows in Networks with Multiple Sources and Sinks, with Applications to Oil and Gas Lease Investment Programs
• The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
• A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
• 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
• A Joint Vehicle Routing and Speed Optimization Problem
• The Optimum Distribution of Effort

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