Editing Combinatorial optimization (section)

==Specific problems==
{{Further|Category:Combinatorial optimization}}
{{Dynamic list}}
[[Image:TSP Deutschland 3.png|thumb|200px|An optimal traveling salesman tour through [[Germany]]’s 15 largest cities. It is the shortest among the 43,589,145,600<ref>Take one city, and take all possible orders of the other 14 cities. Then divide by two because it does not matter in which direction in time they come after each other: 14!/2 = 43,589,145,600.</ref> possible tours that visit each city exactly once.]]
* [[Assignment problem]]
* [[Bin packing problem]]
* [[Chinese postman problem]]
* [[Closure problem]]
* [[Constraint satisfaction problem]]
* [[Cutting stock problem]]
* [[Dominating set]] problem
* [[Integer programming]]
* [[Job shop scheduling]]
* [[Knapsack problem]]
* [[Metric k-center]] / vertex k-center problem
* [[Minimum relevant variables in linear system]]
* [[Minimum spanning tree]]
* [[Nurse scheduling problem]]
* [[Ring star problem]]
* [[Set cover problem]]
* [[Talent scheduling]]
* [[Traveling salesman problem]]
* [[Vehicle rescheduling problem]]
* [[Vehicle routing problem]]
* [[Weapon target assignment problem]]