{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002644241,0.001530669,0.001451138,0.0007873556,0.0005134473,0.001669415,0.001215844,0.001192129,0.00497626],"category_scores_gemma":[0.007138219,0.0006813431,0.00123798,0.0009575822,0.00122614,0.002065176,0.001708549,0.005147046,0.000901698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001177857,"about_ca_system_score_gemma":0.001213344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002905051,"about_ca_topic_score_gemma":0.001794597,"domain_scores_codex":[0.9984584,0.0006129337,0.00004621341,0.0002114746,0.0005131171,0.0001579258],"domain_scores_gemma":[0.9978542,0.001353059,0.0001691189,0.0001783214,0.0003512558,0.00009395021],"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.00013373,0.0001771158,0.0003226723,0.0002317548,0.00003266093,0.0001162478,0.0001587495,0.7306251,0.004188716,0.1851322,0.007627152,0.07125392],"study_design_scores_gemma":[0.0000122358,0.00003238329,0.00005619448,0.00001502743,0.000004315581,0.00002370132,0.00001224849,0.9794018,0.0005379129,0.01791534,0.001984043,0.000004748439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004280417,0.0001949762,0.991173,0.0002385035,0.00003684886,0.00004977811,0.0000528814,0.00008114048,0.003892399],"genre_scores_gemma":[0.1958263,0.0008144313,0.792295,0.0003267098,0.0002420197,0.000413978,0.0005976111,0.0003610062,0.009122955],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00497626,"threshold_uncertainty_score":0.01664728,"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."}}