Skip to main content
SpringerLink
Log in

Supernode processing of mixed-integer models

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

This paper discusses processing software for large scale mixed-integer optimization models. The software is part of the Mathematical OPtimization System MOPS [18] which contains algorithms for solving large-scale LP and mixed-integer programs. The processing techniques are implemented in such a way that they can be applied not only initially but also during the branch-and-bound algorithm.

This paper discusses only a subset of the processing techniques included in MOPS. Algorithmic and software design aspects of the branch-and-bound process are not part of this paper.

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

Similar content being viewed by others

References

  1. Brearley, A.L., Mitra, G. and Williams, H.P., “Analysis of mathematical programming problems prior to applying the simplex algorithm,”Math. Prog., 8, 54–83, 1975.

    Google Scholar 

  2. Crowder, H., Johnson, E.L., and Padberg, M.W., “Solving large-scale zero-one linear programming problems,”Oper. Res., 31, 803–834, 1983.

    Google Scholar 

  3. Dietrich, B.L. and Escudero, L.F., “Coefficient reduction for knapsack constraints in 0–1 programs with VUBs,”Oper. Res. Lett., 9, 9–14, 1990.

    Google Scholar 

  4. Dietrich, B.L. and Escudero, L.F., “Coefficient reduction with cover inequalities,” RC 14913, IBM, T. J. Watson Research Center, Yorktown Heights, N.Y., 1989.

    Google Scholar 

  5. Dietrich, B.L., Escudero, L.F., and Chance, F., “Efficient reformulation for 0–1 programms—methods and computational results,”Discrete Applied Mathematics, 42, 147–175, 1993.

    Google Scholar 

  6. Guignard, M. and Spielberg, K., “Logical reduction methods in zero-one programming (minimal preferred variables),”Oper. Res., 29, 49–74, 1981.

    Google Scholar 

  7. Hoffmann, K. and Padberg, M.W., “Improving LP-representations of zero-one linear programs for branch-and-cut,”ORSA Journal on Computing, 3, 121–134, 1991.

    Google Scholar 

  8. Hoffmann, K. and Padberg, M.W., “LP-based combinatorial problem solving,”Annals of Operations Research, 4, 145–194, 1985.

    Google Scholar 

  9. Johnson, E.L., Kostreva, M.M. and Suhl, U.H., “Solving 0–1 integer programming problems arising from large-scale planning models,”Oper. Res., 35, 803–819, 1985.

    Google Scholar 

  10. Johnson, E.L. and Padberg, M.W., “Degree—Two Inequalities, Clique Facets and Biperfect Graphs,”Ann. Discrete Mathematics, 16, 169–187, 1982.

    Google Scholar 

  11. Mairs, T.G., Wakefield, G.W., Johnson, E.L., and Spielberg, K., “On a production allocation and allocation and distribution problem,”Management Science, 24, 1622–1630, 1978.

    Google Scholar 

  12. Nemhauser, G.L. and Wolsey, L.A., “Integer and Combinatorial Optimization,” Wiley, New York, 1988.

    Google Scholar 

  13. Savelsbergh, M.W.P., “Preprosessing and Probing Techniques for Mixed Integer Programming Problems,”ORSA Journal on Computing, to appear 1994.

  14. Spielberg, K. and Suhl, U.H., “An experimental software system for large scale 0–1 problems with efficient data structures and access to MPSX/370,” IBM Research Report RC 8219, IBM T. J. Watson Research Center, Yorktown Heights, N.Y., 1980.

    Google Scholar 

  15. Suhl, U.H., “Solving large-scale mixed integer programs with fixed charge variables”,Math. Programming, 32, 165–182, 1985.

    Google Scholar 

  16. Suhl, U.H. and Suhl, L.M., “Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases,”ORSA Journal on Computing, 2, 325–335, 1990.

    Google Scholar 

  17. Suhl, L.M. and Suhl, U.H., “A Fast LU-update for linear programming,”Annals of Operations Research, 43, 33–47, 1993.

    Google Scholar 

  18. Suhl, U.H., “MOPS—Mathematical Optimization System,”European Journal of Operational Research, 72, 312–322, 1994.

    Google Scholar 

  19. Van Roy, T. and Wolsey, L.A., “Solving mixed integer programming problems using automatic reformulation,”Oper. Res., 35, 45–57, 1987.

    Google Scholar 

  20. Williams, H.P., “Model Building in Mathematical Programming,” Wiley, N.Y., 1978.

    Google Scholar 

  21. Wolsey, L.A., “Tight formulations for mixed integer programming: A survey,”Math. Programming, 45, 173–191, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Wirtschaftsinformatik und Operations Research, Freie Universität Berlin, Garystr. 21, D-14195, Berlin

    Uwe H. Suhl & Ralf Szymanski

Authors
  1. Uwe H. Suhl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ralf Szymanski
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Dedicated to Professor George B. Dantzig on the occasion of his eightieth birthday.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Suhl, U.H., Szymanski, R. Supernode processing of mixed-integer models. Comput Optim Applic 3, 317–331 (1994). https://doi.org/10.1007/BF01299207

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01299207

Keywords

Search

Navigation