{"id":"W2157555448","doi":"10.1287/moor.1090.0419","title":"A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Mathematics; Relaxation (psychology); Quadratic assignment problem; Mathematical optimization; Quadratically constrained quadratic program; Quadratic programming; Dimension (graph theory); Quadratic equation; Positive-definite matrix; Majorization; Upper and lower bounds; Optimization problem; Combinatorics; Eigenvalues and eigenvectors; Mathematical analysis","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.003835394,0.001507523,0.001146006,0.0008608851,0.0005499054,0.001874246,0.00151598,0.001431788,0.006187938],"category_scores_gemma":[0.01304165,0.0006633454,0.001011765,0.001254413,0.001598746,0.002680795,0.002195567,0.005917253,0.001659724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001261818,"about_ca_system_score_gemma":0.001857858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001090551,"about_ca_topic_score_gemma":0.00143021,"domain_scores_codex":[0.9978747,0.0008778144,0.0000923163,0.0003967778,0.0006151207,0.0001432565],"domain_scores_gemma":[0.9932972,0.004582959,0.0005405197,0.0005954078,0.000720199,0.0002637124],"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.0001905926,0.0003896736,0.0004114571,0.0004496236,0.00006229508,0.0001490221,0.0001817132,0.6666509,0.006182275,0.2206442,0.01546162,0.08922665],"study_design_scores_gemma":[0.00002672505,0.00009404499,0.00008535076,0.00003073468,0.000007403464,0.00005626929,0.00003008442,0.9448938,0.001103568,0.05025526,0.003400741,0.00001595577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003847922,0.0001557108,0.9907823,0.0003568941,0.00005039644,0.00005805619,0.0001286425,0.0001366315,0.004483555],"genre_scores_gemma":[0.2067596,0.0007820115,0.7825029,0.0005565302,0.000281996,0.0006944551,0.001090202,0.0004302448,0.006901942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006187938,"threshold_uncertainty_score":0.02070075,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1558959852504453,"score_gpt":0.4509045053540539,"score_spread":0.2950085201036086,"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."}}