ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1394. Ships. Version 2

Show all messages Hide all messages

RT
Re: can this problem solved by linear programming?(1000 veraibles and 110 Inequalities) Vedernikoff 'Goryinyich' Sergey (HSE: АОП) 14 Feb 2014 19:35
At 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....)