Jump to content

Combinatorial optimization

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Altenmann (talk | contribs) at 20:46, 4 January 2004. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Combinatorial optimization is a branch of Optimization in Applied mathematics and Computer science, related to Operations research, Algorithm theory and Computational complexity theory.

Sometimes it is also called discrete optimization, however some consider the latter term to be somewhat different.

The domain of combinatorial optimization is problems where the set of admissible solutions is discrete, and the goal is to find the best possible solution.

Examples are Traveling salesman problem, minimum spanning tree problem, linear programming problem.

References

  • William J. Cook, William H. Cunningham, William R. Pulleyblank, Alexander Schrijver; Combinatorial Optimization; John Wiley & Sons; 1 edition (November 12, 1997); ISBN: 047155894X.
  • Christos H. Papadimitriou, and Kenneth Steiglitz; Combinatorial Optimization : Algorithms and Complexity; Dover Pubns; (paperback, Unabridged edition, July 1998) ISBN: 0486402584.

Journals

This article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Combinatorial_optimization&oldid=2085328"