Unrestricted Faithful Rounding is Good Enough for Some LNS Applications.

Mark G. Arnold Colin D. Walter

Published in: IEEE Symposium on Computer Arithmetic (2001)

Keyphrases

approximation algorithms
linear programming
hybrid algorithm
mixed integer
upper bound
feasible solution
feature selection
metadata
image processing
data streams
data analysis
special case
simulated annealing
complete axiomatization
tight upper and lower bounds