Algorithms for separable nonlinear resource allocation problems
From MaRDI portal
Recommendations
- An algorithm for separable nonlinear minimax problems
- Methods and algorithms for solving the resource allocation problem
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- The Nonlinear Resource Allocation Problem
- Separable convex resource allocation problem with \(L_1\)-distance constraint
Cited in
(46)- Convergent Lagrangian and domain cut method for nonlinear knapsack problems
- Inverse optimization for linearly constrained convex separable programming problems
- An algorithm for separable nonlinear minimax problems
- A constrained nonlinear 0-1 program for data allocation
- The nonlinear knapsack problem - algorithms and applications
- Algorithms for separable convex optimization with linear ascending constraints
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
- A heuristic algorithm for a chance constrained stochastic program
- A survey on the continuous nonlinear resource allocation problem
- Optimum component test plans for phased-mission systems
- A branch-and-bound based method for solving monotone optimization problems
- A fast algorithm for quadratic resource allocation problems with nested constraints
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints
- A decomposition algorithm for nested resource allocation problems
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Methods and algorithms for solving the resource allocation problem
- COMPUTING OPTIMAL ALLOCATIONS FOR DISCRETE‐TIME NONLINEAR NATURAL RESOURCE MODELS
- scientific article; zbMATH DE number 544186 (Why is no real title available?)
- A specially structured nonlinear integer resource allocation problem
- scientific article; zbMATH DE number 1547881 (Why is no real title available?)
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- scientific article; zbMATH DE number 1848395 (Why is no real title available?)
- The Nonlinear Resource Allocation Problem
- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
- On a Reduction for a Class of Resource Allocation Problems
- Near-Optimal Solution of Generalized Resource Allocation Problems with Large Capacities
- Separable convex resource allocation problem with \(L_1\)-distance constraint
- scientific article; zbMATH DE number 970360 (Why is no real title available?)
- Marginal Allocation Algorithm For Nonseparable Functions
- An optimization problem with a separable non-convex objective function and a linear constraint
- Efficient resource allocation with non-concave objective functions
- A pegging algorithm for the nonlinear resource allocation problem
- Resource allocation problems with expensive function evaluations
- Continuous equality knapsack with probit-style objectives
- Optimal inexactness schedules for tunable oracle-based methods
- A breakpoint search approach for convex resource allocation problems with bounded variables
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- Decomposition of uniform resource allocation problems
- Algorithmic problems of nontransitive (SSB) utilities
- Exact algorithm for concave knapsack problems: linear underestimation and partition method
- Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions
- Resource planning and allocation problem under uncertain environment
- A unified method for a class of convex separable nonlinear knapsack problems
- Nonconvex piecewise linear knapsack problems
- Solving knapsack problems with \(S\)-curve return functions
- The design of optimum component test plans for system reliability
This page was built for publication: Algorithms for separable nonlinear resource allocation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2770087)
