Some Problems in Combinatorial Optimization
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.
KeywordsShort Path Time Slot Bipartite Graph Assignment Problem Optimal Schedule
Unable to display preview. Download preview PDF.