Chapter 1 An Introduction to Combinatorial Problems and Techniques.
33
Chapter 1 An Introduction to Combinatorial Problems and Techniques
-
date post
21-Dec-2015 -
Category
Documents
-
view
219 -
download
1
Transcript of Chapter 1 An Introduction to Combinatorial Problems and Techniques.
Chapter 1
An Introduction to Combinatorial Problems and Techniques
2
Determining Existence Counting Optimization
algorithm
3
1.1 THE TIME TO COMPLETE A PROJECT
The Problem
4
5
Analysis
6
7
8
9
The Complete Diagram
10
Critical Path Analysis (PERT)
11
Critical Path
12
A Construction Example
13
14
1.2 AMATCHING PROBLEM The Problem
An airline flying out of New York has seven long flights on its Monday morning schedule: Los Angeles, Seattle, London, Frankfurt, Paris, Madrid, and Dublin. Fortunately, seven capable pilots are available: Alfors, Timmack, Jelinek, Tang, Washington, Rupp, and Ramirez. There is a complication, however. Pilots are allowed to request particular destinations, and these requests are to be honored if possible. The pilots and the cities they requested are as follows: Los Angeles: Timmack, Jelinek, Rupp Seattle: Alfors, Timmack, Tang, Washington London: Timmack, Tang, Washington Frankfurt: Alfors, Tang, Rupp, Ramirez Paris: Jelinek, Washington, Rupp Madrid: Jelinek, Ramirez Dublin: Timmack, Rupp, Ramirez
15
16
Analysis
(1)How much work will this be? In particular, how many arrangements will we have to check?
(2)How can we generate all possible arrangements so that we are sure we have not missed any?
17
18
19
20
The Practicality of Our Solution to the Airline Problem
21
1.3 A KNAPSACK PROBLEM
The Problem
22
23
24
25
26
27
28
1.4 ALGORITHMS AND THEIREFFICIENCY
29
30
31
32
33
