Technical Note—Allocation of Effort Resources among Competing Activities
From MaRDI portal
Publication:4053351
DOI10.1287/opre.23.2.360zbMath0298.90015MaRDI QIDQ4053351
Publication date: 1975
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.23.2.360
Related Items
Max-min resource allocation, A graphical method to solve a family of allocation problems, Discrete resource allocation with tree constraints by an incremental method, Alternatives for reliable and quality telecommunication network design, A particle swarm optimization approach to the nonlinear resource allocation problem, Multiobjective resource allocation problem by multistage decision-based hybrid genetic algorithm, Convex programming with single separable constraint and bounded variables, Variable fixing algorithms for the continuous quadratic Knapsack problem, An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP), A unified method for a class of convex separable nonlinear knapsack problems, Solving knapsack problems with \(S\)-curve return functions, Inverse optimization for linearly constrained convex separable programming problems, A weak linearization of the Kuhn- Tucker conditions for a class of allocation problems, Fuzzy resource allocation, Resource allocation among competing activities: A lexicographic minimax approach, An algorithm for separable nonlinear minimax problems, A graphical bicriteria approach to the resource allocation problem, Simple solution procedures for nonlinear programming problems that are derivative decomposable, A nonlinear minimax allocation problem with multiple knapsack constraints, An algorithm for the fair resource allocation problem with a submodular constraint, On a general network location--production--allocation problem, A min-max resource allocation problem with substitutions, Quadratic resource allocation with generalized upper bounds, A nonlinear knapsack problem, On the solution of concave knapsack problems, A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks, A survey on the continuous nonlinear resource allocation problem, Breakpoint searching algorithms for the continuous quadratic knapsack problem, Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique, Ant colony optimization for the nonlinear resource allocation problem, An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint, Solution of some convex separable resource allocation and production planning problems with bounds on the variables, Theoretical framework for the analysis of linearly constrained convex programs, Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables, Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints, Order transmission efficiency optimization in hierarchical organizations, Unnamed Item, A polynomially bounded algorithm for a singly constrained quadratic program, Solution techniques for some allocation problems, Maximum likelihood estimation of cell probabilities in constrained multinomial models
