2004 | OriginalPaper | Buchkapitel
Some Problems in Combinatorial Optimization
verfasst von : Professor Dr. Peter Brucker
Erschienen in: Scheduling Algorithms
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.