The Surplus Inventory Matching Problem in the Process Industry

References

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