Skip to main content

Integer Models

  • Chapter
  • First Online:
  • 2974 Accesses

Abstract

The examples on “network design” (p. 15), “river and flood models” (p. 20) and “urban water systems” (p. 21) lead us to consider networks. A useful way to describe a network is to define for each pair of nodes a function whose value is 1 if there is a direct connection between these nodes in the network, and 0 otherwise. More generally, x = 1 can be used to indicate that a certain event occurs and x = 0 that it does not. Indeed, binary (i.e., 0-1-valued) variables appear in many models, and so do also other integer-valued variables. In this chapter we shall take a look at such models.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   64.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Dantzig, G.B.: Origins of the simplex method. Technical report SOL 87–5, Stanford University, Stanford. http://www.dtic.mil/dtic/tr/fulltext/u2/a182708.pdf (1987)

  2. Eiselt, H.A., Sandblom, C.-L.: Integer Programming and Network Models. Springer, Berlin (2000)

    Book  MATH  Google Scholar 

  3. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, 2nd edn. Springer, Berlin (1993)

    Book  MATH  Google Scholar 

  4. Hoffman, A.J., Kruskal, J.B.: Integral boundary points of convex polyhedra. In: Kuhn, H.W., Tucker, A.W. (eds.) Linear Inequalities and Related Systems. Annals of Mathematics Studies, vol. 38, pp. 223–246. Princeton University Press, Princeton (1956)

    Google Scholar 

  5. Korte, B., Vygen, J.: Combinatorial Optimization. Theory and Algorithms, 2nd edn. Springer, Berlin (2001)

    Google Scholar 

  6. Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley, New York (1988)

    Book  MATH  Google Scholar 

  7. Schrijver, A.: Combinatorial Optimization. Polyhedra and Efficiency, vol. A-C. Springer, Berlin (2003)

    Google Scholar 

  8. Seymour, P.D.: Decomposition of regular matroids. J. Combin. Theory. Ser. B 28, 305–359 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  9. Wolsey, L.A.: Integer Programming. Wiley, New York (1998)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jorma Merikoski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Silvennoinen, R., Merikoski, J. (2016). Integer Models. In: Pohjolainen, S. (eds) Mathematical Modelling. Springer, Cham. https://doi.org/10.1007/978-3-319-27836-0_4

Download citation

Publish with us

Policies and ethics