Combinatorial Optimization Algorithm

A Combinatorial Optimization Algorithm is an optimization algorithm that can be applied by a combinatorial optimization system (to solve a combinatorial optimization task).

• Example(s):
  • a Brute-Force Optimization Algorithm, using brute-force search.
  • a Traveling Salesman Algorithm.
  • a Knapsack Packing Algorithm.
  • …
• Counter-Example(s):
  • a Continuous Optimization Algorithm.
• See: Discrete Optimization Task, Graph Matching Algorithm.

---

---

References

2014

• http://wikipedia.org/wiki/Combinatorial_optimization#Methods
  • There is a large amount of literature on polynomial-time algorithms for certain special classes of discrete optimization, a considerable amount of it unified by the theory of linear programming. Some examples of combinatorial optimization problems that fall into this framework are shortest paths and shortest path trees, flows and circulations, spanning trees, matching, and matroid problems.

    For NP-complete discrete optimization problems, current research literature includes the following topics:

    • polynomial-time exactly solvable special cases of the problem at hand (e.g. see fixed-parameter tractable)
    • algorithms that perform well on "random" instances (e.g. for TSP)
    • approximation algorithms that run in polynomial time and find a solution that is "close" to optimal
    • solving real-world instances that arise in practice and do not necessarily exhibit the worst-case behavior inherent in NP-complete problems (e.g. TSP instances with tens of thousands of nodes).
  • Combinatorial optimization problems can be viewed as searching for the best element of some set of discrete items; therefore, in principle, any sort of search algorithm or metaheuristic can be used to solve them. However, generic search algorithms are not guaranteed to find an optimal solution, nor are they guaranteed to run quickly (in polynomial time). Since some discrete optimization problems are NP-complete, such as the traveling salesman problem, this is expected unless P=NP.

---