Category:Combinatorial optimization

From Wikipedia, the free encyclopedia

You have new messages (last change).

The main article for this category is Combinatorial optimization.

Subcategories

There are 2 subcategories to this category shown below (more may be shown on subsequent pages).

C

Computational complexity theory

G

Graph algorithms

Pages in category "Combinatorial optimization"

There are 13 pages in this section of this category.

A

B

C

D

Dijkstra's algorithm

E

Ellipsoid method

G

Greedoid

G cont.

Greedy randomized adaptive search procedure

L

List of knapsack problems

M

Maximum satisfiability problem

W

Weight function

Retrieved from "http://en.wikipedia.org../../../c/o/m/Category%7ECombinatorial_optimization_b0bb.html"

Categories: Optimization algorithms | Combinatorial algorithms | Optimization

Views

interaction

Search

In other languages