Category:Combinatorial optimization

C

• Covering problems (11 P)

E

• Exchange algorithms (10 P)

L

• Linear programming (1 C, 59 P)

M

• Matroid theory (3 C, 66 P)

N

• Network flow problem (22 P)
• Number partitioning (12 P)

O

• Optimal scheduling (23 P)

P

• Packing problems (2 C, 29 P)

R

• Rainbow problems (4 P)

S

• Scheduling (computing) (4 C, 13 P)

T

• Travelling salesman problem (18 P)

• Combinatorial optimization
• Submodular set function
• Symmetry-breaking constraints

0–9

• 1-center problem

A

• A* search algorithm
• Assignment problem

B

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

C

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

D

• Dijkstra's algorithm
• Dinitz–Garg–Goemans conjecture

E

• Edge cycle cover
• Jack Edmonds
• Egalitarian item allocation
• Ellipsoid method
• European Chapter on Combinatorial Optimization
• Extremal combinatorics

F

• Floorplan (microelectronics)

G

• Generalized assignment problem
• Gilbert–Pollak conjecture
• Gomory–Hu tree
• Graph bandwidth
• Graph cut optimization
• Greedoid
• Greedy randomized adaptive search procedure

H

• Hungarian algorithm

I

• Integer programming
• Ising machine

K

• Kernighan–Lin algorithm
• Knapsack problem

L

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

M

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

N

• Network flow problem

O

• Optimal network design

P

• Parametric search

Q

• Quadratic assignment problem
• Quadratic bottleneck assignment problem
• Quadratic knapsack problem
• Quadratic pseudo-Boolean optimization

S

• Smallest-circle problem
• Snow plow routing problem
• Steiner travelling salesman problem
• Subadditive set function
• Submodular flow
• Superadditive set function

T

• Travelling salesman problem

U

• Utility functions on indivisible goods

V

• Vehicle routing problem
• Vertex k-center problem

W

• Weapon-target assignment problem
• Weight function