{"id":"W2039616602","doi":"10.1016/j.endm.2010.05.094","title":"An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization","year":2010,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Cutting-plane method; Iterated function; Mathematics; Interior point method; Quadratic equation; Binary number; Point (geometry); Relaxation (psychology); Quadratically constrained quadratic program; Mathematical optimization; Quadratic programming; Plane (geometry); Algorithm; Applied mathematics; Mathematical analysis; Integer programming; Geometry; Arithmetic","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"],"consensus_categories":[],"category_scores_codex":[0.002029767,0.0004181799,0.0006188452,0.0003388963,0.000181113,0.0001462976,0.0006649776,0.0002632091,0.0003418813],"category_scores_gemma":[0.00432292,0.0003874116,0.0001345821,0.0004992926,0.0001100185,0.0004732354,0.000128171,0.0008856342,0.00000926472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000232661,"about_ca_system_score_gemma":0.0002438766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001154725,"about_ca_topic_score_gemma":0.0002049457,"domain_scores_codex":[0.9968737,0.0001637205,0.0009768999,0.0005859053,0.0003760119,0.001023741],"domain_scores_gemma":[0.9958582,0.002293962,0.000419773,0.001011525,0.0002484245,0.0001681021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007180765,0.003221762,0.0001339418,0.004195048,0.0004720461,0.0000331581,0.01323327,0.2401834,0.2545584,0.4511894,0.0003780951,0.03168346],"study_design_scores_gemma":[0.0008931347,0.0004161515,0.000001370155,0.00006694519,0.00003655408,0.00002837127,0.0002676429,0.805956,0.009378995,0.1825414,0.00004830537,0.0003651031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009035639,0.00003550245,0.9882089,0.0003533663,0.0001429036,0.001777654,0.00002826524,0.000233876,0.0001839311],"genre_scores_gemma":[0.04802754,0.00002874483,0.9508631,0.00005397472,0.0001317321,0.0004055525,0.0001123258,0.0001695066,0.0002074923],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5657727,"threshold_uncertainty_score":0.9998578,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02022941623167324,"score_gpt":0.3790834266210562,"score_spread":0.358854010389383,"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."}}