|
|
back to boardShow all messages Hide all messagesAt least, it can be written as linear programming problem. However, it is INTEGER linear programming problem, which still remains to be NP-hard. can we use simplex() to solve floating version of lp, then use it as heuristics: brute force to search in descending order of veriable x.. I will try this approach to test case 70(toooooooooooooo hard....) |
|
|