IBM®
Skip to main content
    Country/region [change]    Terms of use
 
 
 
    Home    Products    Services & solutions    Support & downloads    My account    

IBM Journal of Research and Development
Business Optimization   Volume 51, Number 3/4, 2007
Table of contents: HTMLPDF This article: HTMLPDF   Copyright info

The material allocation problem in the steel industry - References

 by H. Yanagisawa
References

  1. G. T. Ross and R. M. Soland, “A Branch and Bound Algorithm for the Generalized Assignment Problem,” Math. Program. 8, No. 1, 91–103 (1975).
  2. P. Hansen and N. Mladenovic, “An Introduction to Variable Neighborhood Search,” Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, S. Voss, S. Martello, I. H. Osman, and C. Roucairol, Editors, Kluwer Academic Publishers, Boston, MA, 1999, pp. 433–458.
  3. F. Glover, “Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems,” Discrete Appl. Math. 65, No. 1, 223–253 (1996).
  4. J. L. Bentley, “Fast Algorithms for Geometric Traveling Salesman Problems,” ORSA J. Computing 4, No. 4, 387–411 (1992).
  5. M. Beck and S. Robins, “Explicit and Efficient Formulas for the Lattice Point Count in Rational Polygons Using Dedekind–Rademacher Sums,” Discrete & Computational Geometry 27, No. 4, 443–459 (2002).
  6. J. R. Kalagnanam, M. W. Dawande, M. Trumbo, and H. S. Lee, “Inventory Matching Problems in the Steel Industry,” Technical Report RC-21171, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1998.
  7. J. R. Kalagnanam, M. W. Dawande, M. Trumbo, and H. S. Lee, “The Surplus Inventory Matching Problem in the Process Industry,” Oper. Res. 48, No. 4, 505–516 (2000).
  8. G. E. Andrews, Number Theory, Dover Publications, Inc., New York, 1994.
  9. T. T. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
  10. A. I. Barvinok, “Computing the Ehrhart Polynomial of a Convex Lattice Polytope,” Discrete & Computational Geometry 12, No. 1, 35–48 (1994).
  11. J. A. De Loera, R. Hemmecke, J. Tauzer, and R. Yoshida, “Effective Lattice Point Counting in Rational Convex Polytopes,” J. Symbol. Comput. 38, No. 4, 1273–1302 (2004).
  12. H. Yanagisawa, “A Simple Algorithm for Lattice Point Counting in Rational Polygons,” Technical Report RT-0622, Tokyo Research Laboratory, IBM Japan, Ltd., Yamato-shi, Kanagawa-ken, 242-8502, Japan, 2005.
  13. F. Eisenbrand and R. Rote, “Fast 2-Variable Integer Programming,” Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization, Utrecht, The Netherlands, 2001, pp. 78–89.


    About IBM    Privacy    Contact