A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations

Christoph Buchheim, Marianna De Santis, Laura Palagi. A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations. Oper. Res. Lett., 43(4):384-388, 2015. [doi]

@article{BuchheimSP15,
  title = {A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations},
  author = {Christoph Buchheim and Marianna De Santis and Laura Palagi},
  year = {2015},
  doi = {10.1016/j.orl.2015.05.001},
  url = {http://dx.doi.org/10.1016/j.orl.2015.05.001},
  researchr = {https://researchr.org/publication/BuchheimSP15},
  cites = {0},
  citedby = {0},
  journal = {Oper. Res. Lett.},
  volume = {43},
  number = {4},
  pages = {384-388},
}