In the Vinony graph
Within Vinony's link graph, 离散优化 is referenced by 38 other articles, and connects out to mathematical optimization, greedy algorithm and Bellman–Ford algorithm.
It is catalogued under the topic Mathematical optimization.
Its subject is documented across 8 Wikipedia language editions.
Article · 中文
离散优化是应用数学和计算机科学中优化问题的一个分支。 在此种数学规划中，变量被限制为离散变量，比如整数。与此相对的是。 离散优化存在两个主要的分支。 * 组合优化：指关于图，拟阵等数学结构的问题。 * 此两分支也有着很紧密的关系，许多组合优化问题可以以整数规划来模拟，整数规划问题也可有对应的组合优化版本。
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
mathematical optimization
Entity
greedy algorithm
Entity
Bellman–Ford algorithm
Entity
shortest path problem
Entity
convex optimization
Entity
computer science
Entity
International Standard Book Number
Entity
integer
Entity
function
Entity
variable
Entity
applied mathematics
Entity
discrete mathematics
Entity
graph
Entity
gradient
Entity
Diophantine equation
Entity
linear programming
Entity
Dijkstra's algorithm
Entity
dynamic programming
Entity
simplex algorithm
Entity
evolutionary algorithm
Entity