{"id":"W4293227094","doi":"10.1287/opre.2021.2241","title":"A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"École de Technologie Supérieure; Group for Research in Decision Analysis; Wilfrid Laurier University; Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Binary number; Quadratic equation; Class (philosophy); Mathematical optimization; Quadratic programming; Regular polygon; Bilinear interpolation; Variable (mathematics); Mathematics; Quadratic unconstrained binary optimization; Convex optimization; Computer science; Applied mathematics; Artificial intelligence; Arithmetic; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.00204304,0.00006451514,0.0001073775,0.000234081,0.0005487765,0.00007802527,0.0001003295,0.00003975497,0.0000547096],"category_scores_gemma":[0.0001036378,0.00006712572,0.00001956201,0.0004696812,0.00002847682,0.0002858846,0.00006626554,0.0001855521,0.00000136331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009875712,"about_ca_system_score_gemma":0.00004983173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001802441,"about_ca_topic_score_gemma":0.00003214932,"domain_scores_codex":[0.998801,0.000311255,0.0002341587,0.0001512184,0.0002948592,0.0002075087],"domain_scores_gemma":[0.9994092,0.0000790667,0.00001278479,0.0002062067,0.0002440962,0.00004864199],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003148887,0.0001924841,0.0005497558,0.0002058166,0.00002381067,6.781555e-7,0.004574137,0.9447473,0.02346058,0.01718902,0.0001464423,0.008878471],"study_design_scores_gemma":[0.0004155722,0.0002562866,0.0002701883,0.000007092504,0.00000416318,0.00000264372,0.001044872,0.9961606,0.0007119831,0.0001212566,0.000933461,0.00007183605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7244822,0.00006703765,0.2729101,0.0002748189,0.00006871994,0.001605123,0.0000521684,0.0001238847,0.0004159314],"genre_scores_gemma":[0.899923,0.000005609213,0.09863162,0.00000928197,0.00003055968,0.0008292792,0.0002842043,0.0000251814,0.0002612734],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1754408,"threshold_uncertainty_score":0.42208,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09093636409137897,"score_gpt":0.403254417085231,"score_spread":0.3123180529938521,"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."}}