Download presentation
Presentation is loading. Please wait.
Published byEmerald White Modified over 9 years ago
2
Chapter 2. Optimal Trees and Paths Combinatorial Optimization 2014 1
3
2 2.1 Minimum Spanning Trees
4
Combinatorial Optimization 2014 3
5
4 a b f g k d h 20 29 25 12 16 28 31 32 23 15 18 22 35
6
Combinatorial Optimization 2014 5
7
6
8
7 a b f g k d h 20 29 25 12 16 28 31 32 23 15 18 22 35
9
Combinatorial Optimization 2014 8 a b f g k d h 20 29 25 12 16 28 31 32 23 15 18 22 35
10
Combinatorial Optimization 2014 9
11
10
12
Combinatorial Optimization 2014 11
13
Combinatorial Optimization 2014 12 MST and LP
14
Combinatorial Optimization 2014 13
15
Combinatorial Optimization 2014 14
16
15 Idea of Branch-and-Bound Algorithm (IP) (LPR) Combinatorial Optimization 2014
17
16 Combinatorial Optimization 2014
18
17 Results of solving LP relaxation. 1.unbounded integer program unbounded 2.infeasible integer program infeasible 3.optimal solution which is integer it is optimal to integer program 4.optimal solution not integer only obtain lower bound. Need to branch How to divide the solution set in case of 4. Suppose x * optimal solution to LP relaxation and Then consider 2 sets Any feasible solution to integer program is contained in one of (a), (b). So we do not miss any feasible solution. Then we solve LP relaxation of (a), (b) again. (Search procedure with tree structure) Combinatorial Optimization 2014
19
18 Combinatorial Optimization 2014
20
Procedure to solve the LP relaxation (with many constraints) Cutting plane approach 19 Solve LP relaxation with small number of constraints (e.g., w/o subtour elim. constr.) violated constr? Solve LP after adding the violated constraint. Y N Stop Combinatorial Optimization 2014 * Dual form of column generation, e.g. cutting stock problem.
21
Combinatorial Optimization 2014 20
22
Combinatorial Optimization 2014 21 General questions for a problem: Extreme points of LP relaxation all integer vectors? If not, can we make the polyhedron have only integer extreme points by adding some inequalities to the LP relaxation? How much efforts? If not, can we approximate the integer polyhedron using only part of the inequalities needed to describe it? (obtain good lower bound) How much efforts?
23
Combinatorial Optimization 2014 22
24
Combinatorial Optimization 2014 23
25
Combinatorial Optimization 2014 24
26
Combinatorial Optimization 2014 25
27
Combinatorial Optimization 2014 26
28
Combinatorial Optimization 2014 27
29
Steiner tree problem Combinatorial Optimization 2014 28
30
Combinatorial Optimization 2014 29
31
Example of a Steiner arborescence Combinatorial Optimization 2014 30 a b f g k {r} h : Terminal nodes
32
Combinatorial Optimization 2014 31
33
Combinatorial Optimization 2014 32 Models for Connectivity of Graphs
34
Combinatorial Optimization 2014 33
35
Combinatorial Optimization 2014 34
36
Combinatorial Optimization 2014 35
37
Combinatorial Optimization 2014 36
38
Combinatorial Optimization 2014 37
39
Combinatorial Optimization 2014 38 The structure of the survivable network may depend on the facilities used (e.g. ADM (Add-Drop Multiplexor) needs to configure ring networks )
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.