Skip to main content
SpringerLink
Log in

IP over 40+ Years at IBM Scientific Centers and Marketing

  • 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

  • Balas, E. (1965). “An Additive Algorithm for Solving Linear Programs with Zero-One Variables.” OR, 13, 517–546.

  • Balinski M. (1961). “Fixed Cost Transportation Problems.” Naval Research Logistics Quarterly, 8, 41–54.

    Google Scholar 

  • Balinski M. (1965). “Integer Programming: Methods, Uses, Computation.” Management Science, 14, 253–313.

    Google Scholar 

  • Balinski, M.L. and K. Spielberg. (1969). “Methods for Integer Programming, Algebraic, Combinatorial and Enumerative.” In Julius Aronofsky (Ed.), Progress of OR, Vol. 3. John Wiley & Sons.

  • Benders, J.F. (1962).”Partitioning Procedures for Solving Mixed Variable Programming Problems.” Numerische Mathematik, 4, 8–252.

  • Cornuejols, G., M.L. Fisher, and G.L. Nemhauser. (1977). “Location of Bank Accounts to Optimize Floats; An Analytic Study of Exact and Approximate Algorithms.” Management. Science, 23, 789–810.

    Article  Google Scholar 

  • Crowder, H., E. Johnson, and M. Padberg. (1983). “Solving Large Scale Zero-One Linear Programming Problems.” OR, 31, 803–834.

    Google Scholar 

  • Fischetti, M. and A. Lodi. (2003). “Local Branching.” Math. Pr., 98, 23–47.

    Article  Google Scholar 

  • Fisher M., G.L. Nemhauser, and L. Wolsey. (1978). “Analysis of Approximation Algorithms for Maximizing a Submodular Set Function II.” MP Study, 8, 73–87.

    Google Scholar 

  • Guignard, M. and K. Spielberg. (1968). “Search Techniques with Adaptive Features for Certain Integer and Mixed Integer Programming Problems.” Proceedings IFIPS Congress, Edinburgh.

  • Guignard, M. and K. Spielberg. (1981). “Logical Reduction Methods in 0-1 Programming (Minimal Preferred Inequalities).” OR, 29, 49–74.

    Google Scholar 

  • Guignard, M. and K. Spielberg. (2003). “Double Contraction, Double Probing, Short Starts.” Cliao Meeting, Pucon, Chile; Wharton School Report.

  • Johnson, L., M. Kostreva, and U. Suhl. (1985). “Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models.” OR, 33, 803–819.

    Google Scholar 

  • Land, A.H. and A.G. Doig. (1960) “An Automatic Method for Solving Programming Problems.” Econometrics, 28, 497–520.

    Article  Google Scholar 

  • Lemke, C. and K. Spielberg. (1969). “Direct Search Algorithms for Zero-One and Mixed Integer Programming.” OR, 15, 892–914.

  • Lemke, C., H. Salkin, and K. Spielberg. (1969). “Set Covering by Single Branch Enumeration with Linear Programming Subproblems.” OR, 19, 998–1022.

    Google Scholar 

  • Mairs, T., et al.(1978). “On a Production, Allocation and Distribution Problem.” Management. Science, 24, 622–1630.

    Google Scholar 

  • Spielberg, K. (1969a). “Algorithms for the Simple Plant Location Problem with some Side Conditions.” J. of OR, 17, 85–111.

    Google Scholar 

  • Spielberg, K. (1969b). “Plant Location with Generalized Search Origin.” Management. Science, 16, 165–178.

    Google Scholar 

  • Spielberg, K. (1979). “Enumerative Methods in Integer Programming.” Annals of Discrete Mathematics 5, North Holland, 139–183.

  • Spielberg, K. and U. Suhl. (1980). “An Experimental Software System for Large Scale (0, 1) Problems with Efficient Data Structures and Access to MPSX/370.” IBM Res. Report, 320–3013.

  • Spielberg, K. and M. Guignard. (2000). “A Sequential (Quasi) Hot Start Method for BB (0, 1) Mixed Integer Programming.” Informs Atlanta, Wharton School Report.

  • Spielberg, K. (2001). “New Short Hot Start Methods and Results for BB (0, 1) MIP Programming.” Informs Miami, Wharton School Report.

  • Guignard, M. and K. Spielberg. (2003). “Double Contraction, Double Probing, Short Starts.” Cliao Meeting, Pucon, Chile; Wharton School Report.

  • Spielberg, K. and M. Guignard. (2004). “A Forcing Short Start Method for BB (0, 1) Mixed Integer Programming.” Wharton School Report.

Download references

Author information

Authors and Affiliations

  1. University of PA, Wharton School, Philadelphia, PA, 19104, USA

    Kurt Spielberg

Authors
  1. Kurt Spielberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kurt Spielberg.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Spielberg, K. IP over 40+ Years at IBM Scientific Centers and Marketing. Ann Oper Res 149, 195–208 (2007). https://doi.org/10.1007/s10479-006-0095-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-006-0095-7

Keywords

Search

Navigation