• Combinatorial Programming or Combinatorial Optimization is a subset of ILP (similar to 0-1 Programming) that consists of finding an optimal object from a finite set of objects
  • 0-1 Programming or 0-1 Optimization problem is a type of ILP (similar to Combinatorial Programming) in which some or all of the variables are restricted to be 0 or 1 values

Common Combinatorial Optimization Problems

Ways Solving Combinatorial Optimization Problems

  • greedy search - output not guaranteed optimal