Skip to main content
SpringerLink
Log in

Kombinatorische und (Gemischt-)Ganzzahlige Optimierung

  • Chapter
  • First Online:
Operations Research

  • 5772 Accesses

Zusammenfassung

In diesem Kapitel werden fundamentale Konzepte und Verfahren der kombinatorischen und (gemischt-)ganzzahligen Optimierung vorgestellt. Wir gehen auf drei generische Ansätze ein und betonen dabei die Verwendung von Konzepten der linearen Optimierung als eine wichtige konkrete Ausgestaltung. Abschließend gehen wir auf Kombinationen verschiedener Konzepte ein.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 29.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  • Bellman R (ed) (1957) Dynamic Programming. Princeton University Press

    Google Scholar 

  • Daniel RC, Jeffreys M (1979) Unboundedness in integer and discrete programming l.p. relaxations. Journal of the Operational Research Society 30:1119–1128

    Article  Google Scholar 

  • Gomory RE (1958) Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Society 64:275–278

    Article  Google Scholar 

  • Gomory RE (1960) An algorithm for the mixed integer problem. Technical Report RM-2597, The RAND Cooperation

    Google Scholar 

  • Kellerer H, Pferschy U, Pisinger D (eds) (2004) Knapsack Problems. Springer, Berlin u. a.

    Google Scholar 

  • Kolesar PJ (1967) A branch and bound algorithm for the knapsack problem. Management Science 13:723–735

    Article  Google Scholar 

  • Martello S, Toth P (1997) Upper bounds and algorithms for hard 0-1 knapsack problems. Operations Research 45(5):768–778

    Article  Google Scholar 

  • Miliotis P (1978) Using cutting planes to solve the symmetric travelling salesman problem. Mathematical Programming 15:177–188

    Article  Google Scholar 

  • Morrison DR, Jacobson SH, Sauppe JJ, Sewell EC (2016) Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning. Discrete Optimization 9:79–102

    Article  Google Scholar 

  • Nemhauser G, Wolsey LA (1999) Integer and Combinatorial Optimization. Wiley-Interscience

    Google Scholar 

  • Pferschy U, Staněk R (2017) Generating subtour elimination constraints for the tsp from pure integer solutions. Central European Journal of Operations Research 25(1):231–260

    Article  Google Scholar 

  • Ryan DM, Foster BA (1981) An integer programming approach to scheduling. In: Wren A (ed) Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling, North-Holland, pp 269–280

    Google Scholar 

  • Vance PH, Barnhart C, Johnson EL, Nemhauser GL (1994) Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optimization and Applications 3(2):111–130

    Article  Google Scholar 

  • Volgenant T, Jonker R (1982) A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation. European Journal of Operational Research 9:83–89

    Article  Google Scholar 

  • Wesselmann F (2010) Generating general-purpose cutting planes for mixed-integer programs. University of Paderborn, PhD thesis

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Schumpeter School of Business and Economics, Bergische Universität Wuppertal, Wuppertal, Deutschland

    Dirk Briskorn

Authors
  1. Dirk Briskorn
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer-Verlag GmbH Deutschland, ein Teil von Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Briskorn, D. (2020). Kombinatorische und (Gemischt-)Ganzzahlige Optimierung. In: Operations Research. Springer Gabler, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-60783-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-60783-1_4

  • Published:

  • Publisher Name: Springer Gabler, Berlin, Heidelberg

  • Print ISBN: 978-3-662-60782-4

  • Online ISBN: 978-3-662-60783-1

  • eBook Packages: Business and Economics (German Language)

Publish with us

Policies and ethics

Search

Navigation