Abstract: The Benders’ decomposition algorithm is a technique in mathematical programming for complex mixed-integer linear programming (MILP) problems with a particular block structure. The strategy ...

Abstract: We restrict quadratic forms to subspaces of finite fields and obtain some interesting results about dual spaces. On this basis, we solve the weight hierarchies of a class of linear codes ...