Pages that link to "Item:Q2770087"

The following pages link to Algorithms for separable nonlinear resource allocation problems (Q2770087):

Displaying 35 items.

• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
• A breakpoint search approach for convex resource allocation problems with bounded variables (Q691476) (← links)
• Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
• Decomposition of uniform resource allocation problems (Q795743) (← links)
• Algorithmic problems of nontransitive (SSB) utilities (Q808974) (← links)
• Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
• Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions (Q852959) (← links)
• Resource planning and allocation problem under uncertain environment (Q905152) (← links)
• A unified method for a class of convex separable nonlinear knapsack problems (Q930930) (← 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)
• Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
• An algorithm for separable nonlinear minimax problems (Q1093547) (← links)
• A constrained nonlinear 0-1 program for data allocation (Q1290718) (← links)
• The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
• Algorithms for separable convex optimization with linear ascending constraints (Q1628287) (← links)
• Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem (Q2077958) (← 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)
• A branch-and-bound based method for solving monotone optimization problems (Q2501119) (← links)
• A fast algorithm for quadratic resource allocation problems with nested constraints (Q2669547) (← links)
• An exact algorithm for linear integer programming problems with distributionally robust chance constraints (Q2698584) (← links)
• A decomposition algorithm for nested resource allocation problems (Q2810553) (← links)
• COMPUTING OPTIMAL ALLOCATIONS FOR DISCRETE‐TIME NONLINEAR NATURAL RESOURCE MODELS (Q4248888) (← links)
• A specially structured nonlinear integer resource allocation problem (Q4456095) (← links)
• HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM (Q4649881) (← links)
• The Nonlinear Resource Allocation Problem (Q4897079) (← links)
• A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints (Q5085487) (← links)
• Efficient resource allocation with non-concave objective functions (Q5948405) (← links)
• A pegging algorithm for the nonlinear resource allocation problem (Q5959400) (← links)
• Continuous equality knapsack with probit-style objectives (Q6614696) (← links)
• Optimal inexactness schedules for tunable oracle-based methods (Q6641000) (← links)