Category:Combinatorial optimization

Pages in category "Combinatorial optimization"

The following 21 pages are in this category, out of 21 total. Updates to this list can occasionally be delayed for a few days.

1 1-center problem A A* search algorithm Assignment problem B B* search algorithm Bottleneck traveling salesman problem Branch and cut Bridge and torch problem

C Combinatorial optimization Cutting stock problem D Dijkstra's algorithm E Ellipsoid method F Floorplan (microelectronics) G Greedoid Greedy randomized adaptive search procedure H Harmony search

H cont. Hungarian algorithm K Knapsack problem L List of knapsack problems M Maximum satisfiability problem S Smallest circle problem W Weight function