Pages that link to "Item:Q4053351"

The following pages link to Technical Note—Allocation of Effort Resources among Competing Activities (Q4053351):

Displaying 45 items.

• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
• On the solution of multidimensional convex separable continuous knapsack problem with bounded variables (Q319990) (← links)
• Max-min resource allocation (Q595529) (← links)
• A breakpoint search approach for convex resource allocation problems with bounded variables (Q691476) (← links)
• A graphical method to solve a family of allocation problems (Q791448) (← links)
• Discrete resource allocation with tree constraints by an incremental method (Q799478) (← links)
• Alternatives for reliable and quality telecommunication network design (Q806809) (← links)
• A particle swarm optimization approach to the nonlinear resource allocation problem (Q864762) (← links)
• Multiobjective resource allocation problem by multistage decision-based hybrid genetic algorithm (Q883850) (← links)
• Convex programming with single separable constraint and bounded variables (Q885824) (← links)
• Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220) (← links)
• An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP) (Q929430) (← links)
• A unified method for a class of convex separable nonlinear knapsack problems (Q930930) (← links)
• Solving knapsack problems with \(S\)-curve return functions (Q958108) (← links)
• Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
• A weak linearization of the Kuhn- Tucker conditions for a class of allocation problems (Q1055692) (← links)
• Fuzzy resource allocation (Q1083027) (← links)
• Resource allocation among competing activities: A lexicographic minimax approach (Q1092812) (← links)
• An algorithm for separable nonlinear minimax problems (Q1093547) (← links)
• A graphical bicriteria approach to the resource allocation problem (Q1095044) (← links)
• Simple solution procedures for nonlinear programming problems that are derivative decomposable (Q1102204) (← links)
• A nonlinear minimax allocation problem with multiple knapsack constraints (Q1178726) (← links)
• An algorithm for the fair resource allocation problem with a submodular constraint (Q1179783) (← links)
• On a general network location--production--allocation problem (Q1183612) (← links)
• A min-max resource allocation problem with substitutions (Q1262219) (← links)
• Quadratic resource allocation with generalized upper bounds (Q1376263) (← links)
• Probabilistic solutions for a class of deterministic optimal allocation problems (Q1696457) (← links)
• A nonlinear knapsack problem (Q1905070) (← links)
• On the solution of concave knapsack problems (Q2276878) (← links)
• A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• Breakpoint searching algorithms for the continuous quadratic knapsack problem (Q2465658) (← links)
• Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique (Q2483337) (← links)
• Ant colony optimization for the nonlinear resource allocation problem (Q2489380) (← links)
• An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint (Q2491532) (← links)
• Solution of some convex separable resource allocation and production planning problems with bounds on the variables (Q3008595) (← links)
• Theoretical framework for the analysis of linearly constrained convex programs (Q3328294) (← links)
• Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables (Q3445459) (← links)
• Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints (Q3559429) (← links)
• Order transmission efficiency optimization in hierarchical organizations (Q3683889) (← links)
• A polynomially bounded algorithm for a singly constrained quadratic program (Q3899825) (← links)
• Productivity of activities in the optimal allocation of one resource (Q3941204) (← links)
• Solution techniques for some allocation problems (Q3955156) (← links)
• Maximum likelihood estimation of cell probabilities in constrained multinomial models (Q4253300) (← links)
• A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)