|
1
|
| 授業計画/Class |
【オンライン（オンデマンド型）】全体説明，Formulations |
|
|
2
|
| 授業計画/Class |
1 Formulations
1.1 Introduction
1.2 What is an integer program?
1.3 Formulating IPs and BIPs
|
|
|
3
|
| 授業計画/Class |
1 Formulations
1.4 The Combinatorial Explosion
1.5 Mixed Integer Formulations
|
|
|
4
|
| 授業計画/Class |
1 Formulations
1.6 Alternatives Formulations
|
|
|
5
|
| 授業計画/Class |
2 Optimality, Relaxation, and Bounds
2.1 Optimality and Relaxation
2.2 Linear Programming Relaxations
2.3 Combinatorial Relaxations
2.4 Lagrangian Relaxation
|
|
|
6
|
| 授業計画/Class |
2 Optimality, Relaxation, and Bounds
2.5 Duality
2.6 Primal Bounds: Greedy and Local Search
|
|
|
7
|
| 授業計画/Class |
3 Well-Solved Problems
3.1 Properties of Easy Problems
3.2 IPs with Totally Unimodular Matrices
3.3 Minimum Cost Network Flows |
|
|
8
|
| 授業計画/Class |
6 Complexity and Problem Reductions
6.1 Complexity
6.2 Decision Problems, and Classes NP and P
6.3 Polynomial Reduction and the Class NPC
|
|
|
9
|
| 授業計画/Class |
7 Branch and Bound
7.1 Divide and Conquer
7.2 Implicit Enumeration
|
|
|
10
|
| 授業計画/Class |
8 Cutting Plane Algorithms
8.1 Introduction
8.2 Some Simple Valid Inequalities
8.3 Valid Inequalities
|
|
|
11
|
| 授業計画/Class |
8 Cutting Plane Algorithms
8.7 The Basic Mixed Integer Inequality
8.8 Disjunctive Inequalities |
|
|
12
|
| 授業計画/Class |
10 Lagrangian Duality
10.1 Lagrangian Relaxation
10.2 The Strength of the Lagrangian Dual
|
|
|
13
|
| 授業計画/Class |
Facility Location Problem |
|
|
14
|
| 授業計画/Class |
Vehicle Routing Problem |
|
|
15
|
|
| |
| 事前学習/Preparation |
テキストの該当箇所を読み，理解する。理解のできない事項があれば，必要に応じて文献を参照するなどしてメモを作成する。 |
| 事後学習/Reviewing |
学修範囲について，演習問題などを解き，理解が不十分な箇所をなくす。 |
|