A fast algorithm for quadratic resource allocation problems with nested constraints
From MaRDI portal
Publication:2669547
DOI10.1016/j.cor.2021.105451OpenAlexW3084298752MaRDI QIDQ2669547
Marco E. T. Gerards, Martijn H. H. Schoot Uiterkamp, Johann L. Hurink
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.03880
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- An O(n) algorithm for quadratic knapsack problems
- A linear-time algorithm for a special case of disjoint set union
- Symmetric min-max heap: a simpler data structure for double-ended priority queue
- Time bounds for selection
- Algorithms for separable convex optimization with linear ascending constraints
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- Equivalence of convex minimization problems over base polytopes
- Resource allocation problems in decentralized energy management
- Solving nested-constraint resource allocation problems with an interior point method
- A survey on the continuous nonlinear resource allocation problem
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- On Floyd and Rivest's SELECT algorithm
- A Decomposition Algorithm for Nested Resource Allocation Problems
- Analysis of an exact algorithm for the vessel speed optimization problem
- A Survey on Priority Queues
- Min-max heaps and generalized priority queues
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- Fast Deterministic Selection
- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
