{"id":"W4220679245","doi":"10.1287/ijoc.2022.1161","title":"A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of British Columbia","funders":"","keywords":"Quadratic assignment problem; Bounding overwatch; Mathematical optimization; Relaxation (psychology); Mathematics; Optimization problem; Convergence (economics); Lagrangian relaxation; Quadratic equation; Dual (grammatical number); Multiplier (economics); Exploit; Computer science; Artificial intelligence","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.00358912,0.001354453,0.000739066,0.000999166,0.0007634465,0.001196483,0.001911873,0.001233603,0.008286566],"category_scores_gemma":[0.007276033,0.0005159427,0.001234952,0.0007992088,0.001485954,0.002213138,0.00263945,0.004053752,0.001382056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001323352,"about_ca_system_score_gemma":0.001892383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002369918,"about_ca_topic_score_gemma":0.003060398,"domain_scores_codex":[0.9984713,0.0006474082,0.00006726048,0.0002241253,0.0004560424,0.0001339107],"domain_scores_gemma":[0.9977155,0.0011488,0.0001613494,0.0003279028,0.0005006655,0.0001457504],"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.0002325003,0.00021066,0.0009821776,0.0005733309,0.00008425518,0.0002550654,0.0003744509,0.4319073,0.01586022,0.3790485,0.01217915,0.1582924],"study_design_scores_gemma":[0.00002156481,0.00005824931,0.000162664,0.0000712984,0.00001451938,0.00006881987,0.00003582624,0.9378321,0.00193798,0.05301199,0.006770109,0.00001492329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004517035,0.000230172,0.9863615,0.0002703902,0.00009820362,0.00008344009,0.00006126232,0.00006281448,0.008315189],"genre_scores_gemma":[0.1673516,0.0005990305,0.8211531,0.0005312717,0.0002244127,0.0005176122,0.0003177491,0.0002952368,0.009009893],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008286566,"threshold_uncertainty_score":0.02772135,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03811457354944635,"score_gpt":0.3168046937288804,"score_spread":0.2786901201794341,"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."}}