A pegging algorithm for the nonlinear resource allocation problem

Computers and Operations Research

Volumn 29, Issue 5, 2001, Pages 505-527

  Bretthauer, Kurt M ^a   Shetty, Bala ^b  

^a INDIANA UNIVERSITY   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Branch and bound; Integer programming; Nonlinear resource allocation problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SYSTEMS; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; LINEARIZATION; PROBLEM SOLVING; QUEUEING NETWORKS;

INVENTORY MANAGEMENT;

RESOURCE ALLOCATION;

ALGORITHM;

EID: 0036132136     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00089-7     Document Type: Article

References (30)

1. A branch and search algorithm for a class of nonlinear knapsack problems
2. A model for resource constrained production and inventory management
3. Tradeoff curves, targeting and balancing in manufacturing queueing networks
4. On the topological design of distributed computer networks
5. Fast approximation algorithms for knapsack problems
6. A nonlinear knapsack problem
7. A note on a general non-linear knapsack problem
8. The nonlinear resource allocation problem
9. Disaggregation and resource allocation using convex knapsack problems with bounded variables
10. On the continuous quadratic knapsack problem
11. Algorithms for separable nonlinear resource allocation problems
12. Improved linear integer programming formulations of nonlinear integer problems
13. Compromise allocation in multivariate stratified sampling: An integer solution
14. Multivariate stratified sampling by optimization
15. Algorithms for the least distance problem
16. Quadratic resource allocation with generalized upper bounds
17. A branch and bound algorithm for integer quadratic knapsack problems
18. A projection method for the integer quadratic knapsack problem
19. An O(n) algorithm for quadratic knapsack problems
20. A polynomially bounded algorithm for a singly constrained quadratic program
21. Massively parallel algorithms for singly constrained convex programs
22. An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
23. Algorithms for the solution of quadratic knapsack problems
24. A parallel projection for the multicommodity network model