KnowraCombinatorial optimizationLinked fromLinked fromThe 17 pages that link to Combinatorial optimization, each with the reason it gives.All 17Broader topic 2Related 2Narrower topic 10Compared with 3Integer programmingNarrower topic: Many integer programs are algebraic formulations of combinatorial optimization problems.P versus NP problemNarrower topic: Many optimization problems encode NP-complete decision problems.Greedy algorithmNarrower topic: Greedy algorithms are one approach to optimizing discrete choices.Assignment problemNarrower topic: The assignment problem is a canonical discrete optimization problem.Approximation algorithmNarrower topic: Approximation algorithms target discrete optimization problems whose exact solutions may be computationally difficult.Vehicle routing problemNarrower topic: Choosing route assignments and visit orders makes vehicle routing a combinatorial optimization problem.Max-flow min-cut theoremNarrower topic: The theorem is a canonical example of an exact structural certificate for an optimum.Blossom algorithmNarrower topic: The blossom algorithm became a foundational result in this field.Travelling salesman problemNarrower topic: A tour is a discrete choice of edges optimized for total travel cost.Richard M. KarpNarrower topic: This field connects Karp’s algorithmic research with graph and network problems.