A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- 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
- supportingDOI registered: A matching record was returned by Crossref.
- supportingDOI resolves: A matching record was returned by Crossref.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredOpen access status: Not checked or no result supplied; no credibility inference made.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- supportingMetadata completeness: All 6 scored descriptive metadata groups are present.
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
- crossref · retrieved 2026-09-26T00:21:21.128Z