Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
From MaRDI portal
Publication:3902834
DOI10.1287/MNSC.27.4.431zbMATH Open0454.90059OpenAlexW2143277915MaRDI QIDQ3902834FDOQ3902834
Authors: Gabriel Bitran, Arnoldo C. Hax
Publication date: 1981
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/fd8d156660e61f6a925eb61b97d69d827389b0e9
disaggregationrecursive procedureresource allocationbounded variablescomputational resultshierarchical planningconvex knapsack problems
Cited In (51)
- Continuous equality knapsack with probit-style objectives
- Hierarchical production planning and scheduling in a multi-product, batch process environment
- Solving knapsack problems with \(S\)-curve return functions
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- A graphical bicriteria approach to the resource allocation problem
- Optimizing facility location and design
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
- Solution techniques for some allocation problems
- A penalty algorithm for solving convex separable knapsack problems
- Statistical mechanics analysis of generalized multi-dimensional knapsack problems
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
- The newsvendor problem with capacitated suppliers and quantity discounts
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- A two-phase method for solving continuous rank-one quadratic knapsack problems
- 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
- Inverse optimization for linearly constrained convex separable programming problems
- A Newton's method for the continuous quadratic knapsack problem
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- A breakpoint search approach for convex resource allocation problems with bounded variables
- Application of the dual active set algorithm to quadratic network optimization
- A hierarchical decision support system for production planning (with case study)
- A pegging algorithm for the nonlinear resource allocation problem
- Local minima for indefinite quadratic knapsack problems
- Moving least squares regression for high-dimensional stochastic simulation metamodeling
- Convex programming with single separable constraint and bounded variables
- A unified method for a class of convex separable nonlinear knapsack problems
- Nonconvex piecewise linear knapsack problems
- A survey on the continuous nonlinear resource allocation problem
- An algorithm for the fair resource allocation problem with a submodular constraint
- The nonlinear knapsack problem - algorithms and applications
- Quadratic resource allocation with generalized upper bounds
- Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables
- The discrete forward-reserve problem -- allocating space, selecting products, and area sizing in forward order picking
- Nonlinear integer programming for optimal allocation in stratified sampling
- Probabilistic solutions for a class of deterministic optimal allocation problems
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- Die Bedeutung des Operations Research fuer die hierarchische Produktionsplanung
- Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian
- Order transmission efficiency optimization in hierarchical organizations
- On the resources allocation problem
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
- An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
- Decision model and analysis for investment interest expense deduction and allocation
- Heuristic family disaggregation techniques for hierarchical production planning systems
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)