Algorithms for Separable Nonlinear Resource Allocation Problems
From MaRDI portal
Publication:2770087
DOI10.1287/opre.46.2.272zbMath0979.90109MaRDI QIDQ2770087
Hanan Luss, Muralidharan S. Kodialam
Publication date: 7 February 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.46.2.272
Related Items
A pegging algorithm for the nonlinear resource allocation problem, Exact algorithm for concave knapsack problems: linear underestimation and partition method, Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions, A unified method for a class of convex separable nonlinear knapsack problems, Nonconvex piecewise linear knapsack problems, Solving knapsack problems with \(S\)-curve return functions, The design of optimum component test plans for system reliability, Convergent Lagrangian and domain cut method for nonlinear knapsack problems, The nonlinear knapsack problem - algorithms and applications, A heuristic algorithm for a chance constrained stochastic program, A survey on the continuous nonlinear resource allocation problem, Optimum component test plans for phased-mission systems, A branch-and-bound based method for solving monotone optimization problems
