The nonlinear knapsack problem - Algorithms and applications

European Journal of Operational Research

Volumn 138, Issue 3, 2002, Pages 459-472

  Bretthauer, Kurt M ^a   Shetty, Bala ^b  

^a INDIANA UNIVERSITY   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Integer programming; Nonlinear knapsack problem; Nonlinear programming; Nonlinear resource allocation problem

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; CONSTRAINT THEORY; INTEGER PROGRAMMING; NONLINEAR PROGRAMMING; PROBLEM SOLVING;

NONLINEAR KNAPSACK PROBLEMS;

RESOURCE ALLOCATION;

EID: 0036567983     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00179-5     Document Type: Article

References (51)

1. An O(Nlog(1/ε)) algorithm for the two-resource allocation problem with a non-differentiable convex objective function
2. An efficient algorithm for a class of two-resource allocation problems
3. A note on adapting methods for continuous global optimization to the discrete case
4. Linear programming for the 0-1 quadratic knapsack problem
5. Dissagregation and resource allocation using convex knapsack problems with bounded variables
6. Tradeoff curves, targeting and balancing in manufacturing queueing networks
7. Capacity planning in manufacturing networks with discrete options
8. The nonlinear resource allocation problem
9. Quadratic resource allocation with generalized upper bounds
10. A pegging algorithm for the nonlinear resource allocation problem
11. Nonlinear integer programming for optimal allocation in stratified sampling
12. A branch and bound algorithm for integer quadratic knapsack problems
13. A projection method for the integer quadratic knapsack problem
14. A model for resource constrained production and inventory management
15. An O(n) algorithm for quadratic knapsack problems
16. Exact solution of the quadratic knapsack problem
17. Convex quadratic programming with one constraint and bounded variables
18. Solution techniques for some allocation problems
19. Quadratic knapsack problems
20. On the topological design of distributed computer networks
21. Efficient methods for solving quadratic 0-1 knapsack problems
22. A polynomially bounded algorithm for a singly constrained quadratic program
23. Lower and upper bounds for the allocation problem and other nonlinear optimization problems
24. A nonlinear knapsack problem
25. About strongly polynomial time algorithms for quadratic optimization over submodular constraints
26. On a discrete nonlinear and nonseparable knapsack problem
27. Algorithms for separable nonlinear resource allocation problems
28. Fast approximation algorithms for knapsack problems
29. Constrained multi-item inventory systems: An implicit approach
30. A note on a general non-linear knapsack problem
31. A branch and search algorithm for a class of nonlinear knapsack problems
32. An algorithm for certain quadratic integer programs
33. On some nonlinear knapsack problems
34. Lagrangean methods for the 0-1 quadratic knapsack problem
35. On the solution of concave knapsack problems
36. Massively parallel algorithms for singly constrained convex programs
37. A massively parallel algorithm for nonlinear stochastic network problems
38. A new and efficient algorithm for a class of portfolio selection problems
39. An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
40. Algorithms for the solution of quadratic knapsack problems
41. On the continuous quadratic knapsack problem
42. A parallel projection for the multicommodity network model
43. Solving large sparse nonlinear programs using GRG
44. A note on multi-item inventory systems with limited capacity
45. Solving certain singly constrained convex optimization problems in production planning
46. Simple ranking methods for allocation of one resource