Combinatoric Optimisation Problem

computation

Definition

Combinatoric Optimisation Problem

A combinatoric optimisation problem is a optimisation problem about constructing a subset from a (large) set of discrete elements.

Examples:

• Minimal Spanning Tree
• Shortest Path Problem
• Minimal Vertex Cover Problem
• Minimal Set Cover Problem
• Maximum Independent Set Problem