chapter 1 an introduction to combinatorial problems and techniques

33
Chapter 1 An Introduction to Combinatorial Problems and Techniques

Post on 21-Dec-2015

219 views

Category:

Documents


1 download

TRANSCRIPT

Page 1: Chapter 1 An Introduction to Combinatorial Problems and Techniques

Chapter 1

An Introduction to Combinatorial Problems and Techniques

Page 2: Chapter 1 An Introduction to Combinatorial Problems and Techniques

2

Determining Existence Counting Optimization

algorithm

Page 3: Chapter 1 An Introduction to Combinatorial Problems and Techniques

3

1.1 THE TIME TO COMPLETE A PROJECT

The Problem

Page 4: Chapter 1 An Introduction to Combinatorial Problems and Techniques

4

Page 5: Chapter 1 An Introduction to Combinatorial Problems and Techniques

5

Analysis

Page 6: Chapter 1 An Introduction to Combinatorial Problems and Techniques

6

Page 7: Chapter 1 An Introduction to Combinatorial Problems and Techniques

7

Page 8: Chapter 1 An Introduction to Combinatorial Problems and Techniques

8

Page 9: Chapter 1 An Introduction to Combinatorial Problems and Techniques

9

The Complete Diagram

Page 10: Chapter 1 An Introduction to Combinatorial Problems and Techniques

10

Critical Path Analysis (PERT)

Page 11: Chapter 1 An Introduction to Combinatorial Problems and Techniques

11

Critical Path

Page 12: Chapter 1 An Introduction to Combinatorial Problems and Techniques

12

A Construction Example

Page 13: Chapter 1 An Introduction to Combinatorial Problems and Techniques

13

Page 14: Chapter 1 An Introduction to Combinatorial Problems and Techniques

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

Page 15: Chapter 1 An Introduction to Combinatorial Problems and Techniques

15

Page 16: Chapter 1 An Introduction to Combinatorial Problems and Techniques

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?

Page 17: Chapter 1 An Introduction to Combinatorial Problems and Techniques

17

Page 18: Chapter 1 An Introduction to Combinatorial Problems and Techniques

18

Page 19: Chapter 1 An Introduction to Combinatorial Problems and Techniques

19

Page 20: Chapter 1 An Introduction to Combinatorial Problems and Techniques

20

The Practicality of Our Solution to the Airline Problem

Page 21: Chapter 1 An Introduction to Combinatorial Problems and Techniques

21

1.3 A KNAPSACK PROBLEM

The Problem

Page 22: Chapter 1 An Introduction to Combinatorial Problems and Techniques

22

Page 23: Chapter 1 An Introduction to Combinatorial Problems and Techniques

23

Page 24: Chapter 1 An Introduction to Combinatorial Problems and Techniques

24

Page 25: Chapter 1 An Introduction to Combinatorial Problems and Techniques

25

Page 26: Chapter 1 An Introduction to Combinatorial Problems and Techniques

26

Page 27: Chapter 1 An Introduction to Combinatorial Problems and Techniques

27

Page 28: Chapter 1 An Introduction to Combinatorial Problems and Techniques

28

1.4 ALGORITHMS AND THEIREFFICIENCY

Page 29: Chapter 1 An Introduction to Combinatorial Problems and Techniques

29

Page 30: Chapter 1 An Introduction to Combinatorial Problems and Techniques

30

Page 31: Chapter 1 An Introduction to Combinatorial Problems and Techniques

31

Page 32: Chapter 1 An Introduction to Combinatorial Problems and Techniques

32

Page 33: Chapter 1 An Introduction to Combinatorial Problems and Techniques

33