A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation

Alain Billionnet, Sourour Elloumi, Amélie Lambert

Open source

DOI
10.1007/s10878-012-9560-1
Published
2012-11-14
Container
Journal of Combinatorial Optimization
Publisher
Springer Science and Business Media LLC
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1007/s10878-012-9560-1,
  title = {A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation},
  author = {Alain Billionnet and Sourour Elloumi and Amélie Lambert},
  year = {2012},
  journal = {Journal of Combinatorial Optimization},
  doi = {10.1007/s10878-012-9560-1},
  url = {https://doi.org/10.1007/s10878-012-9560-1}
}

RIS

TY  - JOUR
TI  - A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
AU  - Alain Billionnet
AU  - Sourour Elloumi
AU  - Amélie Lambert
PY  - 2012
JO  - Journal of Combinatorial Optimization
DO  - 10.1007/s10878-012-9560-1
UR  - https://doi.org/10.1007/s10878-012-9560-1
ER  - 

APA

Billionnet, A., Elloumi, S., & Lambert, A. (2012). A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation. Journal of Combinatorial Optimization. https://doi.org/10.1007/s10878-012-9560-1

Source records