UC知道英文运筹书目录翻译
来源：百度知道 编辑：UC知道 时间：2024/05/14 07:47:08
Chapter 2 Modeling with Linear Programming
Chapter 3 The Simplex Method and Sensitivity Analysis
Chapter 4 Duality and Post-Optimal Analysis
5.4 The Assignment Model
5.4.1 The Hungarian Method
5.4.2 Simplex Explanation of the Hungarian Method
Chapter 8 Integer Linear Programming
8.1 Illustrative Applications
8.1.1 Capital Budgeting
8.1.2 Set-Covering Problem
8.1.3 Fixed-Charge Problem
8.1.4 Either-Or and If-Then Constraints
8.2 Integer Programming Algorithms
8.2.1 Branch-and-Bound (B&B) Algorithm
8.2.2 Cutting-Plane Algorithm
8.2.3 Computational Considerations in ILP
8.3 Traveling Salesperson (TSP) Problem
8.3.1 Heuristic Algorithms
8.3.2 B&B Solution Algorithm
8.3.3 Cutting-Plane Algorithm
References <
Chapter 3 The Simplex Method and Sensitivity Analysis
Chapter 4 Duality and Post-Optimal Analysis
5.4 The Assignment Model
5.4.1 The Hungarian Method
5.4.2 Simplex Explanation of the Hungarian Method
Chapter 8 Integer Linear Programming
8.1 Illustrative Applications
8.1.1 Capital Budgeting
8.1.2 Set-Covering Problem
8.1.3 Fixed-Charge Problem
8.1.4 Either-Or and If-Then Constraints
8.2 Integer Programming Algorithms
8.2.1 Branch-and-Bound (B&B) Algorithm
8.2.2 Cutting-Plane Algorithm
8.2.3 Computational Considerations in ILP
8.3 Traveling Salesperson (TSP) Problem
8.3.1 Heuristic Algorithms
8.3.2 B&B Solution Algorithm
8.3.3 Cutting-Plane Algorithm
References <
塑造以线性规划的第2章
第3章单纯形法和灵敏度分析
第4章双重性和岗位优选的分析
5.4任务模型
5.4.1匈牙利方法
5.4.2匈牙利方法的单缸解释
章节8个整数线性规划
8.1说明应用
8.1.1资本预算
8.1.2设置覆盖物问题
8.1.3固定充电问题
8.1.4任一或和，如果然后限制
8.2整数规划算法
8.2.1 Branch-and-Bound (B&B)算法
8.2.2切削平面算法
8.2.3计算考虑在ILP
8.3旅行的推销员(TSP)问题
8.3.1启发式算法
8.3.2 B&B解答算法
8.3.3切削平面算法
参考
第9章确定动态规划
9.1计算的递归本质在DP
9.2批转和落后递归
9.3选择的DP应用
9.3.1背包|宽松|货物装货模型
9.3.2劳工大小模型
9.3.3设备替换模型
9.3.4投资模型
9.3.5库存模型
9¡£第4个问题幅员的