On a Reduction for a Class of Resource Allocation Problems
From MaRDI portal
(Redirected from Publication:5087712)
Recommendations
Cites work
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- A decomposition algorithm for nested resource allocation problems
- A fast algorithm for quadratic resource allocation problems with nested constraints
- A Review for Submodular Optimization on Machine Scheduling Problems
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
- A submodular function minimization algorithm based on the minimum-norm base
- A survey of offline algorithms for energy minimization under deadline constraints
- A survey on the continuous nonlinear resource allocation problem
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- Algorithms for power savings
- Algorithms for separable convex optimization with linear ascending constraints
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- An O(n) algorithm for quadratic knapsack problems
- Analysis of an exact algorithm for the vessel speed optimization problem
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- Convex separable optimization is not much harder than linear optimization
- Convex Separable Problems With Linear Constraints in Signal Processing and Communications
- Eisenberg-Gale markets: algorithms and game-theoretic properties
- Equivalence of convex minimization problems over base polytopes
- Fast algorithms for convex cost flow problems on circles, lines, and trees
- Fast Deterministic Selection
- Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling
- Finding the nearest point in A polytope
- scientific article; zbMATH DE number 544186 (Why is no real title available?)
- scientific article; zbMATH DE number 6253954 (Why is no real title available?)
- Interior point methods 25 years later
- Learning with submodular functions: a convex optimization perspective
- Least d-Majorized Network Flows with Inventory and Statistical Applications
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- Linear time algorithms for some separable quadratic programming problems
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- M-convex function minimization by continuous relaxation approach: proximity theorem and algorithm
- Machine speed scaling by adapting methods for convex optimization with submodular constraints
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- New Viewpoint and Algorithms for Water-Filling Solutions in Wireless Communications
- On a nonseparable convex maximization problem with continuous Knapsack constraints
- On an Allocation Problem with Multistage Constraints
- On Floyd and Rivest's SELECT algorithm
- On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem
- Perspective functions: properties, constructions, and examples
- Perspective functions: proximal calculus and applications in high-dimensional statistics
- Polymatroid optimization, submodularity, and joint replenishment games
- Portfolio optimization with linear and fixed transaction costs
- Practical algorithms for a family of waterfilling solutions
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Resource allocation problems in decentralized energy management
- Resource competition on integral polymatroids
- Solving nested-constraint resource allocation problems with an interior point method
- Solving the continuous nonlinear resource allocation problem with an interior point method
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- Submodular functions and optimization.
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- Time bounds for selection
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- Variable fixing algorithms for the continuous quadratic Knapsack problem
Cited in
(8)- Primitives for resource management in a demand-driven reduction model
- scientific article; zbMATH DE number 4160481 (Why is no real title available?)
- On Resource Allocation Problems with Interval-Scale Coefficients
- Solving a class of two-resource allocation problem by equivalent load method
- A reduction approach to the repeated assignment problem
- An approximate solution to the linear problem of minimizing resource consumption
- On a reduction for a class of resource allocation problems
- Decomposition of uniform resource allocation problems
This page was built for publication: On a Reduction for a Class of Resource Allocation Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087712)
