Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
From MaRDI portal
Publication:319183
DOI10.1016/j.ejor.2015.01.029zbMath1346.90672arXiv1501.07035OpenAlexW2009650852MaRDI QIDQ319183
Christoffer Strömberg, Michael Patriksson
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.07035
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items
Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time ⋮ On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming ⋮ Fast projection onto the simplex and the \(l_1\) ball ⋮ A Level-Set Method for Convex Optimization with a Feasible Solution Path ⋮ A penalty algorithm for solving convex separable knapsack problems ⋮ A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints ⋮ An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives ⋮ On a Reduction for a Class of Resource Allocation Problems ⋮ A fast algorithm for quadratic resource allocation problems with nested constraints ⋮ Solving nested-constraint resource allocation problems with an interior point method ⋮ A centre–free approach for resource allocation with lower bounds ⋮ Resource allocation problems with expensive function evaluations ⋮ Minimum variance allocation among constrained intervals ⋮ A two-phase method for solving continuous rank-one quadratic knapsack problems ⋮ Resource allocation problems in decentralized energy management ⋮ On the optimal design of the randomized unbiased Monte Carlo estimators ⋮ A feasibility-ensured Lagrangian heuristic for general decomposable problems ⋮ Variable fixing method by weighted average for the continuous quadratic knapsack problem ⋮ Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem ⋮ Allocating resources via price management systems: a dynamic programming-based approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Handbook of optimization. From classical to modern approach
- Linear time algorithms for some separable quadratic programming problems
- A breakpoint search approach for convex resource allocation problems with bounded variables
- Semismooth support vector machines.
- An O(n) algorithm for quadratic knapsack problems
- Convex programming with single separable constraint and bounded variables
- A Newton's method for the continuous quadratic knapsack problem
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- A unified method for a class of convex separable nonlinear knapsack problems
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Algorithms for bound constrained quadratic programming problems
- An iterative row-action method for interval convex programming
- On the continuous quadratic knapsack problem
- Allocation of resources according to a fractional objective
- Linear probing and graphs
- Quadratic resource allocation with generalized upper bounds
- An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
- The nonlinear knapsack problem - algorithms and applications
- Nonlinear integer programming for optimal allocation in stratified sampling
- Solving the continuous nonlinear resource allocation problem with an interior point method
- A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
- Optimal tax depreciation lives and charges under regulatory constraints
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- A Newton-type algorithm for solving problems of search theory
- A library for continuous convex separable quadratic knapsack problems
- Constrained multi-item inventory systems: An implicit approach
- A survey on the continuous nonlinear resource allocation problem
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- On linear-time algorithms for the continuous quadratic Knapsack problem
- Production and inventory management under multiple resource constraints
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Towards strong duality in integer programming
- An approximate dynamic programming approach to convex quadratic knapsack problems
- On Floyd and Rivest's SELECT algorithm
- Algorithms for Separable Nonlinear Resource Allocation Problems
- The Theory of Search: Optimum Distribution of Search Effort
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
- Resource Allocation in Multisite Service Systems with Intersite Customer Flows
- A Parallel Projection for the Multicommodity Network Model
- Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
- A lagrangean relaxation algorithm for the constrained matrix problem
- Convex quadratic programming with one constraint and bounded variables
- Quasi-Newton Updates with Bounds
- Tradeoff Curves, Targeting and Balancing in Manufacturing Queueing Networks
- Efficient Algorithms for a Selection Problem with Nested Constraints and Its Application to a Production-Sales Planning Model
- Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
- Simple Ranking Methods for Allocation of One Resource
- A polynomially bounded algorithm for a singly constrained quadratic program
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Solution techniques for some allocation problems
- Computational development of a lagrangian dual approach for quadratic networks
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- Technical Note—Allocation of Effort Resources among Competing Activities
- A Branch and Bound Procedure for a Class of Discrete Resource Allocation Problems with Several Constraints
- 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
- A special newton-type optimization method
- An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- Minimizing Single-Machine Completion Time Variance
- Validation of subgradient optimization
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- A Projection Method for the Integer Quadratic Knapsack Problem
- The Nonlinear Resource Allocation Problem
- The Optimum Distribution of Effort
- Solving Bicriterion Mathematical Programs
- Convex separable minimization subject to bounded variables
- Benchmarking optimization software with performance profiles.
- A pegging algorithm for the nonlinear resource allocation problem
This page was built for publication: Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
