Abstract: Many operation optimization problems such as scheduling and assignment of interest to the automation community are mixed-integer linear programming (MILP) problems. Because of their ...
Abstract: The first linear programming bound is the best known asymptotic upper bound for binary codes, for a certain subrange of distances. Starting from the work of Friedman and Tillich (2005), ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results