Gomory's cutting method (ILP;MILPs Convex Optimization (Non-linear))
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^n*poly(n, m)$)? (previously $O(n^{3})$) == Space Complexity == $O(nm+m^{2})$ words (See simplex algorithm, but also O(m) variables and constraints are introduced) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1953 == Reference == https://www.cs.uleth.ca/~benkoczi/OR/read/cutting-stock-LP.pdf")
Time Complexity
$O({2}^n*poly(n, m)$)? (previously $O(n^{3})$)
Space Complexity
$O(nm+m^{2})$ words
(See simplex algorithm, but also O(m) variables and constraints are introduced)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1953
Reference
https://www.cs.uleth.ca/~benkoczi/OR/read/cutting-stock-LP.pdf