Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables

Cited in

(51)

Continuous equality knapsack with probit-style objectives
Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables
Statistical mechanics analysis of generalized multi-dimensional knapsack problems
Nonlinear integer programming for optimal allocation in stratified sampling
Breakpoint searching algorithms for the continuous quadratic knapsack problem
Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
Optimizing facility location and design
Hierarchical production planning and scheduling in a multi-product, batch process environment
Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
Variable fixing algorithms for the continuous quadratic Knapsack problem
A unified method for a class of convex separable nonlinear knapsack problems
Solving knapsack problems with \(S\)-curve return functions
Probabilistic solutions for a class of deterministic optimal allocation problems
The discrete forward-reserve problem -- allocating space, selecting products, and area sizing in forward order picking
Inverse optimization for linearly constrained convex separable programming problems
An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
A pegging algorithm for the nonlinear resource allocation problem
Nonconvex piecewise linear knapsack problems
A penalty algorithm for solving convex separable knapsack problems
Solution techniques for some allocation problems
Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
Order transmission efficiency optimization in hierarchical organizations
A breakpoint search approach for convex resource allocation problems with bounded variables
On the resources allocation problem
Solution of some convex separable resource allocation and production planning problems with bounds on the variables
Die Bedeutung des Operations Research fuer die hierarchische Produktionsplanung
Application of the dual active set algorithm to quadratic network optimization
A survey on the continuous nonlinear resource allocation problem
Local minima for indefinite quadratic knapsack problems
A hierarchical decision support system for production planning (with case study)
A two-phase method for solving continuous rank-one quadratic knapsack problems
An efficient hybrid algorithm for the separable convex quadratic knapsack problem
The newsvendor problem with capacitated suppliers and quantity discounts
An algorithm for the fair resource allocation problem with a submodular constraint
Variable fixing method by weighted average for the continuous quadratic knapsack problem
A graphical bicriteria approach to the resource allocation problem
Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
Decentral allocation planning in multi-stage customer hierarchies
On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
Simple solution methods for separable mixed linear and quadratic knapsack problem
Moving least squares regression for high-dimensional stochastic simulation metamodeling
Decision model and analysis for investment interest expense deduction and allocation
Convex programming with single separable constraint and bounded variables
A Newton's method for the continuous quadratic knapsack problem
Heuristic family disaggregation techniques for hierarchical production planning systems
Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian
HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
Quadratic resource allocation with generalized upper bounds
A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
The nonlinear knapsack problem - algorithms and applications

This page was built for publication: Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902834)