{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001177344,0.0004796871,0.0008136349,0.0001516895,0.0004260847,0.0004104083,0.0003278076,0.0002453231,0.001113571],"category_scores_gemma":[0.001676718,0.000424037,0.0001995947,0.000474088,0.0006075249,0.0003512242,0.00008820053,0.0003993522,0.00009663561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008257894,"about_ca_system_score_gemma":0.0001117782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000294683,"about_ca_topic_score_gemma":0.000005720246,"domain_scores_codex":[0.9962547,0.0001335864,0.001078495,0.0007126952,0.0007012106,0.001119287],"domain_scores_gemma":[0.9962541,0.002292949,0.000170611,0.0005170277,0.0002853466,0.0004800093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000294063,0.0004987181,0.000006698116,0.000754262,0.00008259348,0.00001537597,0.0008869472,0.00001089999,0.00002972481,0.03719576,0.00006663286,0.960423],"study_design_scores_gemma":[0.003291147,0.0006803828,0.000004071868,0.0004351522,0.0001789818,0.0002556017,0.0008975644,0.5156506,0.0003629132,0.4657559,0.01147906,0.001008672],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002803241,0.00009282822,0.9903378,0.0005767021,0.00003932335,0.003673022,0.00001656797,0.0005348636,0.00192564],"genre_scores_gemma":[0.009373119,0.00001600879,0.9863354,0.00009788556,0.0001528887,0.001222635,0.00002262293,0.0001353418,0.00264409],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9594143,"threshold_uncertainty_score":0.9998211,"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."}}