Google Answers: Boolean Optimization

View Question

Q: Boolean Optimization ( No Answer, 0 Comments )

Question

Subject: Boolean Optimization
Category: Science > Math
Asked by: dave29-ga
List Price: $5.00

Posted: 11 May 2006 02:29 PDT
Expires: 10 Jun 2006 02:29 PDT
Question ID: 727610

I have a Boolean Optimization Problem of the form:

max c^T * x and
A * x = b 
where all x_i \in {0,1} and all entries of b are in Z.

Is it true, that, if A is totally unimodular, the problem can always
be solved in linear time?

Answer

There is no answer at this time.

Comments

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 answers-support@google.com with the question ID listed above. Thank you.

Search Google Answers for

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