update README.md

Author: unerue

.gitignore

@@ -3,6 +3,7 @@
 .git
 *.mps
 *.log
+copy.md
 
 # Folders
 .ipynb_checkpoints/

README.md

@@ -42,69 +42,42 @@
 1. **Knapsack Problem** - [knapsack.ipynb](https://nbviewer.jupyter.org/github/unerue/or-tutorial/blob/master/or-tutorial/integer-programming/knapsack.ipynb)
 2. **Traveling Salesman Problem** - [traveling-salesman.ipynb](https://nbviewer.jupyter.org/github/unerue/or-tutorial/blob/master/or-tutorial/integer-programming/traveling-salesman.ipynb)
 3. **Capital Budgeting Problem** - [capital-budgeting.ipynb](https://nbviewer.jupyter.org/github/unerue/or-tutorial/blob/master/or-tutorial/integer-programming/capital-budgeting.ipynb)
-4. **집합포함문제 (Set Covering Problem)** - []()
-5. **공장입지 선정문제 (Plant Location Problem)** -[]()
-6. **차량경로문제 (Vehicle Routing Problem)** - [vehicle-routing.ipynb](https://nbviewer.jupyter.org/github/unerue/or-tutorial/blob/master/or-tutorial/integer-programming/vehicle-routing.ipynb)
-7. **제약식의 종류 (Kind of Constraints)** - []()
+4. **Set Covering Problem** - []()
+5. **Plant Location Problem** -[]()
+6. **Vehicle Routing Problem** - [vehicle-routing.ipynb](https://nbviewer.jupyter.org/github/unerue/or-tutorial/blob/master/or-tutorial/integer-programming/vehicle-routing.ipynb)
 
 ---
 
 ## 동적계획법<br>Dynamic Programming
 
-1. **최단경로문제 (Shortest Path Problem)** - []()
-2. **배낭문제 (Knapsack Problem)** - []()
-3. **생산계획문제 (Production Planning)** - []()
+1. **Shortest Path Problem** - []()
+2. **Knapsack Problem** - []()
 
 ---
 
 ## 네트워크모형<br>Network Model
 
-1. **최단경로문제 (Shortest Path Problem)** - []()
-2. **최소걸침나무문제 (Minimum Spanning Tree Problem)** -[]()
-3. **최대흐름문제 (Maximum Flow Problem)** - []()
-4. **최소비용흐름문제 (Minimum Cost Flow Problem)** - []()
-
----
-
-## PERT/CPM
-
-1. **PERT/CPM** - []()
-
---- 
-
-## 대기행렬모형<br>Queueing System
-
-1. **M/M/1** - []()
-2. **M/M/s** - []()
+1. **Shortest Path Problem** - []()
+2. **Minimum Spanning Tree Problem** -[]()
+3. **Maximum Flow Problem** - []()
+4. **Minimum Cost Flow Problem** - []()
 
 ---
 
 ## 재고관리<br>Inventory Management
 
-1. **신문판매원 문제 (News Vendor)** - []()
-2. **경제적 주문량 (Economic Order Quantity, EOQ)** - []()
-3. **로트 크기 결정 (Lot-Sizing Problem)** - []()
-4. **일괄구매 모형 (Joint Replenishment Problem, JRP)** - []()
+1. **News Vendor Problem** - []()
+2. **Economic Order Quantity (EOQ)** - []()
+3. **Lot-Sizing Problem** - []()
+4. **Joint Replenishment Problem (JRP)** - []()
 
 ---
 
 ## 일정계획<br>Scheduling
 
-1. **단일 기계 (Single Machine)** - [single-machine.ipynb]()
-2. **흐름 일정계획 (Flow-Shop Scheduling)** - [flow-shop.ipynb]()
-3. **개별 작업장 일정계획 (Job-Shop Scheduling)** - [job-shop.ipynb](https://nbviewer.jupyter.org/github/unerue/or-tutorial/blob/master/or-tutorial/scheduling/job-shop.ipynb)
-
----
-
-## 비선형계획법<br>Nonlinear Programming
-
----
+1. **Single Machine** - []()
+2. **Flow-Shop Scheduling** - []()
+3. **Job-Shop Scheduling** - [job-shop.ipynb](https://nbviewer.jupyter.org/github/unerue/or-tutorial/blob/master/or-tutorial/scheduling/job-shop.ipynb)
 
-## 게임이론<br>Game Theory
 
----
-
-## 마아코브연쇄모형<br>Markov Chain Model
-
----