Pages that link to "Item:Q5959400"

The following pages link to A pegging algorithm for the nonlinear resource allocation problem (Q5959400):

Displaying 28 items.

• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
• A breakpoint search approach for convex resource allocation problems with bounded variables (Q691476) (← links)
• An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint (Q706934) (← links)
• The newsvendor problem with capacitated suppliers and quantity discounts (Q724067) (← links)
• Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
• A particle swarm optimization approach to the nonlinear resource allocation problem (Q864762) (← links)
• A unified method for a class of convex separable nonlinear knapsack problems (Q930930) (← links)
• An exact algorithm for cost minimization in series reliability systems with multiple component choices (Q945416) (← links)
• Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
• Nonconvex piecewise linear knapsack problems (Q948649) (← links)
• Solving knapsack problems with \(S\)-curve return functions (Q958108) (← links)
• The design of optimum component test plans for system reliability (Q959396) (← links)
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
• The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
• Capacity-constrained multiple-market price discrimination (Q1761955) (← links)
• Resource allocation problems in decentralized energy management (Q2014593) (← links)
• Solving nested-constraint resource allocation problems with an interior point method (Q2183209) (← links)
• Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems (Q2371518) (← links)
• A heuristic algorithm for a chance constrained stochastic program (Q2432880) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• Optimum component test plans for phased-mission systems (Q2456421) (← 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)
• HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM (Q4649881) (← links)
• A new exact algorithm for concave knapsack problems with integer variables (Q5031798) (← links)
• An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems (Q5481688) (← links)
• A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)