User TDH

9 Actions

comment

Thanks a lot for your answer, I will check it. It seems that constraint programming too might be a good alternative.

Aug 5, 2015 at 14:08

comment

I agree with you. I read my original post and found it confusing myself. I have clarified the point in the original problem. Thanks again.

Aug 5, 2015 at 13:46

revised

Clarified the problem. Thanks to Igor Rivin.

Aug 5, 2015 at 13:07

Loading…

comment

Thanks a lot for your response. Actually it means $x_i \in \{l_i,l_i+1,l_i+2,\ldots,u_i-1,u_i\}$, with $l_i, u_i$ being non-negative integers.

Aug 5, 2015 at 13:04

awarded

Editor

Aug 5, 2015 at 13:02

revised

Clarified the problem. Thanks to Igor Rivin.

Aug 5, 2015 at 13:00

Loading…

comment

In my problem $n$ is the difference between the number of edges and nodes of a directed graph. For now I am taking $n \leq 50$.

Aug 5, 2015 at 12:55

awarded

Student

Aug 5, 2015 at 2:04

asked

Aug 5, 2015 at 1:31

Loading…