2 ms·
Not sure if this helps, but this paper shows that Integer Linear Programming is solvable in 'pseudo polynomial time' when dealing with fixed constraints - http:
by danpalmer 14y ago
Not sure if this helps, but this paper shows that Integer Linear Programming is solvable in 'pseudo polynomial time' when dealing with fixed constraints - http://lara.epfl.ch/web2010/_media/papadimitriou81complexityintegerprogramming.pdf http://lara.epfl.ch/web2010/_media/papadimitriou81complexity...
- ambrop7 14y agowhich essentially means it needs exponential time, and as such is useless