Rounding Integer Linear Programming Algorithm

From GM-RKB
Revision as of 09:06, 8 January 2013 by Gmelli (talk | contribs) (Text replace - " (2009)" to " (2009)")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

A Rounding Integer Linear Programming Algorithm is an Integer Linear Programming Algorithm that replaces the integrality constraints with a unit interval constraint, solves the resulting linear programming problem, and then rounds the solution to an integral solution.



References

2010

2009

1990