Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Hi algorithm fans! I have problem to solve which is classified as combinational optimization problem. I do not have any background about this technique. Does anyone know any source, tutorial, article where I can learn this technique?
From wikipedia :
In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.
The finite set of objects can be really big and it would take an infinite time to your program to find the solution.
For most of these problems there is no ‘technique’.
I would advise reading the wikipedia article on combinatorial optimization, then look at links such as complexity therory (and complexity class P NP ), and very common examples such as the Travelling salesman problem.
Hope it helps