Some Problems in Combinatorial Optimization

  • Peter Brucker


Some scheduling problems can be solved efficiently by reducing them to well-known combinatorial optimization problems, such as linear programs, maximum flow problems, or transportation problems. Others can be solved by using standard techniques, such as dynamic programming and branch-and-bound methods. In this chapter we will give a brief survey of these combinatorial optimization problems. We will also discuss some of the methods.


Short Path Time Slot Bipartite Graph Assignment Problem Optimal Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Peter Brucker
    • 1
  1. 1.Fachbereich Mathematik/InformatikUniversität OsnabrückOsnabrückGermany

Personalised recommendations