Category:Combinatorial optimization

• Combinatorial optimization (computing)
• Submodular set function (computing)
• Symmetry-breaking constraints (computing)

1

• 1-center problem (computing)

A

• A* search algorithm (computing)
• Assignment problem (computing)

B

• B* (computing)
• Bottleneck traveling salesman problem (computing)
• Branch and bound (computing)
• Branch and cut (computing)
• Branch and price (computing)
• Bridge and torch problem (computing)

C

• Cederbaum's maximum flow theorem (computing)
• Change-making problem (computing)
• Closure problem (computing)
• Combinatorial data analysis (computing)
• Combinatorial search (computing)
• Continuous knapsack problem (computing)
• Criss-cross algorithm (computing)
• Cut (graph theory) (computing)
• Cutting stock problem (computing)

D

• Dijkstra's algorithm (computing)

E

• Edge cycle cover (computing)
• Jack Edmonds (biography)
• Ellipsoid method (computing)
• European Chapter on Combinatorial Optimization (organization)
• Extremal combinatorics (computing)

F

• Floorplan (microelectronics) (computing)

G

• Generalized assignment problem (computing)
• Gomory–Hu tree (computing)
• Graph bandwidth (computing)
• Graph cut optimization (computing)
• Greedoid (computing)
• Greedy randomized adaptive search procedure (computing)

H

• Hungarian algorithm (computing)

I

• Integer programming (computing)

J

• Job shop scheduling (computing)

K

• Kernighan–Lin algorithm (computing)
• Knapsack problem (computing)

L

• Lin–Kernighan heuristic (computing)
• Linear bottleneck assignment problem (computing)
• Linear programming relaxation (computing)
• List of knapsack problems (computing)

M

• Matching (graph theory) (computing)
• Matroid intersection (computing)
• Matroid parity problem (computing)
• Max-flow min-cut theorem (computing)
• Maximum cut (computing)
• Maximum satisfiability problem (computing)
• Maximum weight matching (computing)
• Metric k-center (computing)
• Minimum k-cut (computing)
• Minimum relevant variables in linear system (computing)
• Multiprocessor scheduling (computing)

N

• Network flow problem (computing)
• Nurse scheduling problem (computing)

P

• Parametric search (computing)

Q

• Quadratic assignment problem (computing)
• Quadratic bottleneck assignment problem (computing)
• Quadratic knapsack problem (computing)
• Quadratic pseudo-Boolean optimization (computing)

S

• Smallest-circle problem (computing)
• Steiner travelling salesman problem (computing)
• Subadditive set function (computing)
• Superadditive set function (computing)

T

• Travelling salesman problem (computing)

U

• Utility functions on indivisible goods (computing)

V

• Vehicle routing problem (computing)
• Vertex k-center problem (computing)

W

• Weapon target assignment problem (computing)
• Weight function (computing)