On a Reduction for a Class of Resource Allocation Problems
From MaRDI portal
Publication:5087712
DOI10.1287/ijoc.2021.1104OpenAlexW4206768198MaRDI QIDQ5087712
Martijn H. H. Schoot Uiterkamp, Marco E. T. Gerards, Johann L. Hurink
Publication date: 1 July 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.11829
computational complexityapplicationsnonlinearanalysis of algorithmsengineeringconvexprogramminginteger
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of offline algorithms for energy minimization under deadline constraints
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Interior point methods 25 years later
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- Linear time algorithms for some separable quadratic programming problems
- An O(n) algorithm for quadratic knapsack problems
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- Eisenberg-Gale markets: algorithms and game-theoretic properties
- 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
- Time bounds for selection
- Algorithms for separable convex optimization with linear ascending constraints
- Perspective functions: properties, constructions, and examples
- Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- Solving the continuous nonlinear resource allocation problem with an interior point method
- 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 strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
- Perspective functions: proximal calculus and applications in high-dimensional statistics
- A survey on the continuous nonlinear resource allocation problem
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- Portfolio optimization with linear and fixed transaction costs
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Submodular functions and optimization.
- On Floyd and Rivest's SELECT algorithm
- On a nonseparable convex maximization problem with continuous Knapsack constraints
- A fast algorithm for quadratic resource allocation problems with nested constraints
- A Decomposition Algorithm for Nested Resource Allocation Problems
- Analysis of an exact algorithm for the vessel speed optimization problem
- Fast algorithms for convex cost flow problems on circles, lines, and trees
- Polymatroid Optimization, Submodularity, and Joint Replenishment Games
- Resource Competition on Integral Polymatroids
- M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm
- A Review for Submodular Optimization on Machine Scheduling Problems
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- Finding the nearest point in A polytope
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- Convex Separable Problems With Linear Constraints in Signal Processing and Communications
- Fast Deterministic Selection
- Algorithms for power savings
- New Viewpoint and Algorithms for Water-Filling Solutions in Wireless Communications
- Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints
- Practical algorithms for a family of waterfilling solutions
- Learning with Submodular Functions: A Convex Optimization Perspective
- On an Allocation Problem with Multistage Constraints
- Least d-Majorized Network Flows with Inventory and Statistical Applications
- On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem
- Convex separable optimization is not much harder than linear optimization
