Google Answers Logo
View Question
Q: Combinatorial Optimization ( No Answer,   0 Comments )
Subject: Combinatorial Optimization
Category: Science > Math
Asked by: dave29-ga
List Price: $7.00
Posted: 12 Jun 2006 01:47 PDT
Expires: 12 Jul 2006 01:47 PDT
Question ID: 737392
I have a heuristic algorithm (not randomized!) to find solutions in a
combinatorial problem. What is the best way to prove/evaluate the
algorithm (correctness, completeness, perfomrance, average distance of
results to global optimum).

I thought about fitness landscapes, but my real-life-problem is
NP-hard and even with less input data the search space becomes huge.
So, I cant calculate the fitness landscape of such a problem.

My question: What else can I do?
There is no answer at this time.

There are no comments at this time.

Important Disclaimer: Answers and comments provided on Google Answers are general information, and are not intended to substitute for informed professional medical, psychiatric, psychological, tax, legal, investment, accounting, or other professional advice. Google does not endorse, and expressly disclaims liability for any product, manufacturer, distributor, service or service provider mentioned or any opinion expressed in answers or comments. Please read carefully the Google Answers Terms of Service.

If you feel that you have found inappropriate content, please let us know by emailing us at with the question ID listed above. Thank you.
Search Google Answers for
Google Answers  

Google Home - Answers FAQ - Terms of Service - Privacy Policy