{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001162633,0.001152618,0.002042686,0.001027826,0.0005388352,0.0009379985,0.002223359,0.00162178,0.008897497],"category_scores_gemma":[0.002138363,0.0007128654,0.001154406,0.001195618,0.0006840944,0.0009300183,0.001592279,0.002654501,0.00194442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004494378,"about_ca_system_score_gemma":0.001065939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00248925,"about_ca_topic_score_gemma":0.002420146,"domain_scores_codex":[0.9993322,0.0001625018,0.00002557769,0.00007247277,0.0003652202,0.00004194218],"domain_scores_gemma":[0.9994469,0.0002453898,0.00002713553,0.0000597319,0.0001863757,0.00003447345],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002808874,0.0003234555,0.0003876574,0.0003986258,0.00007894231,0.0001159894,0.0001358374,0.4920985,0.01250018,0.05143688,0.008333485,0.4339096],"study_design_scores_gemma":[0.0000342911,0.0000429723,0.00006285944,0.00001074014,0.000009091013,0.00002677469,0.000005326785,0.9926199,0.000604022,0.004209111,0.002366473,0.000008441718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0019823,0.00008755153,0.9954488,0.00004242935,0.00007598184,0.00003475449,0.00002182818,0.0001583288,0.002148051],"genre_scores_gemma":[0.03792731,0.0001289668,0.9582586,0.00007734013,0.00006001422,0.0001870205,0.0001139064,0.0001873592,0.003059578],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008897497,"threshold_uncertainty_score":0.02976507,"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."}}