Annals of Operations Research

, Volume 149, Issue 1, pp 75–80

Some of my favorite integer programming applications at IBM

Article

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bermon, S. and S. Hood. (1999). “Capacity Optimization Planning System (Caps).” Interfaces, 29, 31–50.CrossRefGoogle Scholar
  2. Crowder, H., E. Johnson, and M. Padberg. (1983). “Solving Lage Scale Zero-One Linear Programming Problems.” Operations Research, 31, 8-3-834.Google Scholar
  3. Dietrich, B. (1989). “A two Phase Heuristic for Scheduling Parallel Unrelated Machines with Setups.” In K. Stecke and R. Suri (eds.), Proceedings of the Third ORSA/TIMS Conference on Flexible Manufacturing Systems, pp. 187–192.Google Scholar
  4. Dietrich, B. (1990). “Monge Sequences, Antimatroids, and the Transportation Problem with Forbidden Arcs.” Linear Algebra and Its Applications, 139, 133–145.CrossRefGoogle Scholar
  5. Dietrich, B. and L. Escudero. (1989). “On Solving a 0-1 Model for Workload Allocation on Parallel Unrelated Machines with Setups.” Title. In K. Stecke and R. Suri (eds.), Proceedings of the Third ORSA/TIMS Conference on Flexible Manufacturing Systems, pp. 181–186.Google Scholar
  6. Dietrich, B. and L. Escudero. (1990) “Coefficient Reduction for Knapsack-Like Constraints in 0-1 Programs with Variable Upper Bounds.” Operations Research Letters, 9(1), 9–14.CrossRefGoogle Scholar
  7. Dietrich, B. and L. Escudero. (1991). “New Procedures for Preprocessing 0-1 Models with Knapsack-Like Constraints and Conjunctive and/or Disjunctive Variable Upper Bounds.” Information Systems and Operations Research (INFOR), 29, 303–317.Google Scholar
  8. Dietrich, B. and L. Escudero. (1992). “On Tightening Cover Induced Inequalities.” European Journal of Operational Research, 60, 335–343.CrossRefGoogle Scholar
  9. Dietrich, B., L. Escudero, and F. Chance. (1993). “Efficient Reformulation for 0-1 Programs—Methods and Computational Results.” Discrete Applied Mathematics, 42, 147–175.CrossRefGoogle Scholar
  10. Dietrich, B. and L. Escudero. (1993). “On Modelling the Maximum Workload Allocation for Parallel Unrelated Machines with Setups.” Annals of Operation Research, 43, 359–377.Google Scholar
  11. Dietrich, B. and L. Escudero. (1994). “Obtaining Clique, Cover and Coefficient Reduction Inequalities as Chvatal-Gomory Inequalities and Gomory Fractional Cuts.” European Journal of Operational Research, 73(3), 539–546.CrossRefGoogle Scholar
  12. Dietrich, B. and B. March. (1985). “An Application of a Hybrid Approach to Modeling a Flexible Manufacturing System.” Annals of Operations Research, 3, 263–276.CrossRefGoogle Scholar
  13. Dietrich, B., D. Connors, T. Ervolina, J. Fasano, R. Lougee-Heimer, and R. Wittrock. (2004). “Appliations of Implosion in IBM Manufacturing.” In C. An and H. Fromm (eds.), IBM Supply Chain Solutiona, Springer Verlag. pp. 106–125.Google Scholar
  14. Escudero, L. (1994). “CMIT: A Capacitated Multi-level Implosion Tool.” European Journal on Operational Research, 76, 511–528.CrossRefGoogle Scholar
  15. Garfinkel, R. and G. Nemhauser. (1972). Integer Programming. John Wiley & Sons.Google Scholar
  16. Hoffman, A. (1963). “On Simple Linear Programming Problems.” In Proc. Symposia in Pure Mathematics VII, Amer. Math. Soc., pp. 317–327Google Scholar
  17. Lougee-Heimer, R., F. Barahona, B. Dietrich, J. Fasano, J. Forrest, R. Harder, L. Ladanyi, T. Pfender, T. Ralphs, M. Saltzman, and K. Scheinberg. (2001). “The COIN-OR Initiative: Accelerating Operations Research Progress Through Open-Source Software.” ORMS Today, 28(5), 20–22.Google Scholar
  18. Luss, H. and D. Smith. (1986). “Resource Allocation Among Competing Activities: A Lexicographical Minimax Approach.” Operations Research Letters, 6, 227–231.CrossRefGoogle Scholar
  19. Lyon, P., R. Milne, R. Orzell, and R. Rice. (2001). “Matching Assets with Demand in Supply-Chain Management at IBM Microelectronics.” Interfaces, 31, 108–124.CrossRefGoogle Scholar
  20. Shamir, R. and B. Dietrich. (1990). “Characterization and Algorithms for Greedily Solvable Transportation Problems.” In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 385–366.Google Scholar
  21. Snowdon, J. (1994). “Workflow Control for Surges form a Batch Work Station.” Unpublished Ph.D. Dissertation, Industrial and Systems Engineering, Georgia Institute of Technology.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2006

Authors and Affiliations

  1. 1.IBM Watson Research CenterYorktown HeightsUSA

Personalised recommendations