Cutting planes from the Boolean Quadric Polytope can be used to reduce the optimality gap of the NP-hard nonconvex quadratic program with box constraints (BoxQP). It is known that all cuts of the Chvátal–Gomory closure of the Boolean Quadric Polytope are A -odd cycle inequalities. We obtain a...

This paper considers extensions of 2-dimensional factor models to higher-dimension data that can be represented as tensors. I describe decompositions of tensors that generalize the standard matrix singular value decomposition and principal component analysis to higher dimensions. I estimate the...

This paper considers extensions of 2-dimensional factor models to higher-dimension data that can be represented as tensors. I describe decompositions of tensors that generalize the standard matrix singular value decomposition and principal component analysis to higher dimensions. I estimate the...

Introduction to QUBO -- Applications and Computational Advances for Solving the QUBO Model -- Complexity and Polynomially Solvable Special Cases of QUBO -- The Boolean Quadric Polytope -- Autarkies and Persistencies for QUBO -- Mathematical Programming Models and Exact Algorithms -- The Random...