{"id":"W1530501119","doi":"10.1007/s101079900106","title":"A branch and cut algorithm for nonconvex quadratically constrained quadratic programming","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":183,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Quadratic growth; Mathematics; Tree (set theory); Linearization; Mathematical optimization; Quadratic programming; Quadratic equation; Node (physics); Quadratically constrained quadratic program; Branch and cut; Second-order cone programming; Algorithm; Linear programming; Combinatorics; Convex optimization; Nonlinear system","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00144356,0.001212079,0.001778485,0.001206032,0.0009482417,0.001234931,0.001765559,0.002258352,0.007754014],"category_scores_gemma":[0.004658587,0.001009384,0.0007664801,0.001959278,0.0009093366,0.001513507,0.001865227,0.003522258,0.001608102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007934156,"about_ca_system_score_gemma":0.001783268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003748431,"about_ca_topic_score_gemma":0.005178853,"domain_scores_codex":[0.9992907,0.0002074557,0.00002862278,0.00009681411,0.0003129761,0.00006350636],"domain_scores_gemma":[0.9983032,0.001096781,0.00006838516,0.00009839737,0.0003421851,0.00009101101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003292231,0.0002578297,0.0003733341,0.0002246974,0.0000833788,0.0001087442,0.000111895,0.4169171,0.004449695,0.06466906,0.01577404,0.496701],"study_design_scores_gemma":[0.00005032679,0.00003601056,0.00006467827,0.00001574259,0.000009746008,0.00002209772,0.000008438965,0.9774302,0.0005657231,0.01964753,0.00214192,0.000007607512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002301384,0.0001586696,0.9951733,0.0001328611,0.0000629458,0.00005095738,0.0000451497,0.0002609335,0.001813794],"genre_scores_gemma":[0.03269897,0.0001704469,0.9636718,0.00009115249,0.00006700198,0.0002048171,0.0001824531,0.0002095059,0.002703794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007754014,"threshold_uncertainty_score":0.02593982,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03949063608831347,"score_gpt":0.3537206788466457,"score_spread":0.3142300427583322,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}