274
个编辑
更改
→Specific problems
* [[Assignment problem]]
* [[Assignment problem]]
'''<font color="#FF8000">指派问题 Assignment Problem </font>'''
* [[Closure problem]]
* [[Closure problem]]
'''<font color="#FF8000">封闭性问题 Closure Problem </font>'''
* [[Constraint satisfaction problem]]
* [[Constraint satisfaction problem]]
'''<font color="#FF8000">约束满足问题 Constraint Satisfaction Problem </font>'''
* [[Cutting stock problem]]
* [[Cutting stock problem]]
'''<font color="#FF8000">切割问题 Cutting Stock Problem </font>'''
*[[Dominating set]] problem
*[[Dominating set]] problem
'''<font color="#FF8000">控制集 Dominating Set </font>'''问题
* [[Integer programming]]
* [[Integer programming]]
'''<font color="#FF8000">整数规划 Integer Programming </font>'''
* [[Knapsack problem]]
* [[Knapsack problem]]
'''<font color="#FF8000">背包问题 Knapsack Problem </font>'''
*[[Minimum relevant variables in linear system]]
*[[Minimum relevant variables in linear system]]
'''<font color="#FF8000">线性系统中的最小相关变量 Minimum Relevant Variables In Linear System </font>'''
*[[Minimum spanning tree]]
*[[Minimum spanning tree]]
'''<font color="#FF8000">最小生成树 Minimum Spanning Tree </font>'''
* [[Nurse scheduling problem]]
* [[Nurse scheduling problem]]
'''<font color="#FF8000">护士调度问题 Nurse Scheduling Problem </font>'''
*[[Set cover problem]]
*[[Set cover problem]]
'''<font color="#FF8000">集合覆盖问题 Set Cover Problem </font>'''
* [[Traveling salesman problem]]
* [[Traveling salesman problem]]
'''<font color="#FF8000">旅行商问题 Traveling Salesman Problem </font>'''
* [[Vehicle rescheduling problem]]
* [[Vehicle rescheduling problem]]
'''<font color="#FF8000">车辆重新安排问题 Vehicle Rescheduling Problem </font>'''
* [[Vehicle routing problem]]
* [[Vehicle routing problem]]
'''<font color="#FF8000">车辆线路优化问题 Vehicle Routing Problem </font>'''
* [[Weapon target assignment problem]]
* [[Weapon target assignment problem]]
'''<font color="#FF8000">武器目标分配问题 Weapon Target Assignment Problem </font>'''
==See also==
==See also==