Surplus inventory matching problem in the process industry

Operations Research

Volumn 48, Issue 4, 2000, Pages 505-516

  Kalagnanam, Jayant R ^a   Dawande, Milind W ^a   Trumbo, Mark ^a   Lee, Ho Soo ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; HEURISTIC PROGRAMMING; IRON AND STEEL INDUSTRY; IRON AND STEEL PLANTS; MINING; OPTIMIZATION; PRODUCTION CONTROL; SCHEDULING; STRATEGIC PLANNING;

NETWORK FLOW BASED HEURISTIC; OPERATIONS PLANNING; SURPLUS INVENTORY;

INVENTORY CONTROL;

EID: 0034221374     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.48.4.505.12425     Document Type: Article

References (21)

1. R. K. Ahuja, T. L. Magnanti, J. B. Orlin. 1993. Network Flows. Prentice Hall, New Jersey.
2. E. G. Coffman, M. R. Garey, D. S. Johnson. 1984. Approximation algorithms for bin-packing: An updated survey. In G. Ausiello, M. Lucertini, and P. Serafini, eds., Algorithm Design for Computer System Design, pp. 49-106. Springer-Verlag, Wien.
3. _, _, _. 1997. Approximation algorithms for bin-packing: A survey. In D. S. Hochbaum, ed., Approximation Algorithms for NP-hard Problems, pp. 46-93. PWS Publishing Company, Boston.
4. M. Dawande, J. Kalagnanam. 1998. The multiple knapsack with color constraints. Technical Report RC21138, IBM T. J. Watson Research Center, Yorktown Heights, NY.
5. _, _, P. Keskinocak, R. Ravi, F. S. Salman. 1998. Approximation algorithms for the multiple knapsack problem with assignment restrictions. Technical Report RC 21138, IBM T.J. Watson Research Center, Yorktown Heights, NY.
6. _, _, J. Sethuraman. 1998. Variable size bin packing with color constraints. Technical Report RC21350, IBM T.J. Watson Research Center, Yorktown Heights, NY.
7. C. E. Ferreira, A. Martin, R. Weismantel. 1996. Solving multiple knapsack problems by cutting planes. SIAM J. Optimization 6 (3): 858-877.
8. _, M. A. Langston. 1986. Variable sized bin packing. SIAM J. Computing, 15 222-230.
9. M. R. Garey, D. S. Johnson. 1979. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco.
10. E. S. Gottlieb, M. R. Rao. 1990. The generalized assignment problem: Vaid inequalities and facets. Math. Programming 46 31-52.
11. M. Grotschel, L. Lovas, A. Schrijver. 1981. The ellipsoid method and its consequences for combinatorial optimization. Combinatorica 1 169-198.
12. E. Horowitz, S. Sahni. 1978. Fundamentals of Data Structures. Computer Science Press, Maryland.
13. M. S. Hung, J. C. Fisk. 1978. An algorithm for 0-1 multiple knapsack problems. Naval Res. Logist. Quart. 24 571-579.
14. R. M. Karp. Reducibility among combinatorial problems. In R.E. Miller and J.W. Thatcher, eds., Complexity of Computer Computations, pp. 85-103. Plenum Press, New York.
15. S. Martello, P. Toth. 1980. Solution of the zero-one multiple knapsack problem. Euro. J. Oper. Res. 4 322-329.
16. _, _. 1981a. A bound and bound algorithm for the zero-one multiple knapsack problem. Discrete Applied Math. 3 275-288.
17. _, _. 1981b. Heuristic algorithms for the multiple knapsack problem. Computing 27 93-112.
18. _, _. 1989. Knapsack Problems. Wiley, New York.
19. _, _. 1990a. Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York.
20. _, _. 1990b. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Math. 28 59-70.
21. M. A. Trick. 1992. A linear relaxation heuristic for the generalized assignment problem. Naval Res. Logist. 39 137-152.