- 博客(5)
- 收藏
- 关注
原创 在coursera上学习discrete optimization时关于linear programming的笔记整理
Linear programmingDefinition(from Wikipedia)Linear programming (LP, also called linear optimization) is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematica...
2020-02-15 21:49:49
2248
原创 在coursera上学习discrete optimization时关于local search的笔记整理
Local searchGeneral introduction:Local search is a heuristic algorithm for solving optimization problem. Local search move from a configuration to another configuration by performing local moves. Lo...
2020-02-13 12:32:50
2143
原创 在coursera上学习discrete optimization时关于dynamic programming的笔记整理
Dynamic programming is somehow like filling a table.Usually the current problem can be divided into several subproblem which is in the same form as the original problem, dynamic programming is simila...
2020-02-06 15:30:46
221
原创 在coursera上学习discrete optimization时关于branch and bound的笔记整理
Branch and bound (BB, B&B, or BnB) is an algorithm design paradigm for discrete and combinatorial optimization problems, as well as mathematical optimization. A branch-and-bound algorithm consists...
2020-02-06 15:29:38
304
原创 在coursera上学习discrete optimization时关于constraint programming的笔记整理
Constraint programminghttps://www.coursera.org/learn/discrete-optimizationGeneral introductionConstraint programming is an optimization technique that emerged from the field of artificial intellige...
2020-02-06 12:23:00
684
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人