Skip to main content
SpringerLink
Log in

Some of my favorite integer programming applications at IBM

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • Bermon, S. and S. Hood. (1999). “Capacity Optimization Planning System (Caps).” Interfaces, 29, 31–50.

    Article  Google Scholar 

  • Crowder, H., E. Johnson, and M. Padberg. (1983). “Solving Lage Scale Zero-One Linear Programming Problems.” Operations Research, 31, 8-3-834.

  • 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.

  • Dietrich, B. (1990). “Monge Sequences, Antimatroids, and the Transportation Problem with Forbidden Arcs.” Linear Algebra and Its Applications, 139, 133–145.

    Article  Google Scholar 

  • 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.

  • 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.

    Article  Google Scholar 

  • 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 

  • Dietrich, B. and L. Escudero. (1992). “On Tightening Cover Induced Inequalities.” European Journal of Operational Research, 60, 335–343.

    Article  Google Scholar 

  • Dietrich, B., L. Escudero, and F. Chance. (1993). “Efficient Reformulation for 0-1 Programs—Methods and Computational Results.” Discrete Applied Mathematics, 42, 147–175.

    Article  Google Scholar 

  • 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 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

  • Escudero, L. (1994). “CMIT: A Capacitated Multi-level Implosion Tool.” European Journal on Operational Research, 76, 511–528.

    Article  Google Scholar 

  • Garfinkel, R. and G. Nemhauser. (1972). Integer Programming. John Wiley & Sons.

  • Hoffman, A. (1963). “On Simple Linear Programming Problems.” In Proc. Symposia in Pure Mathematics VII, Amer. Math. Soc., pp. 317–327

  • 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.

  • Luss, H. and D. Smith. (1986). “Resource Allocation Among Competing Activities: A Lexicographical Minimax Approach.” Operations Research Letters, 6, 227–231.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

  • Snowdon, J. (1994). “Workflow Control for Surges form a Batch Work Station.” Unpublished Ph.D. Dissertation, Industrial and Systems Engineering, Georgia Institute of Technology.

Download references

Author information

Authors and Affiliations

  1. IBM Watson Research Center, Yorktown Heights, NY, 19598, USA

    Brenda Dietrich

Authors
  1. Brenda Dietrich
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Brenda Dietrich.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dietrich, B. Some of my favorite integer programming applications at IBM. Ann Oper Res 149, 75–80 (2007). https://doi.org/10.1007/s10479-006-0102-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-006-0102-z

Keywords

Search

Navigation