{"id":"W4410574230","doi":"10.1007/s10878-025-01302-6","title":"The independent quadratic assignment problem: complexity and polynomially solvable special cases","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Northwestern Polytechnical University; National Natural Science Foundation of China","keywords":"Theory of computation; Mathematics; Quadratic equation; Quadratic assignment problem; Combinatorics; Computational complexity theory; Discrete mathematics; Mathematical optimization; Computer science; Optimization problem; Algorithm","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.002526424,0.001714434,0.002589751,0.001633381,0.00227124,0.007302909,0.003748431,0.003747528,0.01340066],"category_scores_gemma":[0.02561031,0.001369841,0.002207394,0.003746421,0.002690121,0.009735819,0.003006653,0.006572109,0.001496737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002558532,"about_ca_system_score_gemma":0.00256591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003584672,"about_ca_topic_score_gemma":0.004592863,"domain_scores_codex":[0.9955765,0.00118598,0.0002194492,0.0009420014,0.001016879,0.001059183],"domain_scores_gemma":[0.9722661,0.02275316,0.001723457,0.001536126,0.001021125,0.0006999794],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001698432,0.001985015,0.004714471,0.001651605,0.0003516465,0.001738275,0.0008289631,0.180583,0.003920658,0.6496311,0.07927466,0.07362222],"study_design_scores_gemma":[0.0002397837,0.00007690113,0.0008886718,0.00005357966,0.0000801081,0.0006787702,0.0002585249,0.2984818,0.001080464,0.6937647,0.00434063,0.0000559916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3783004,0.004897974,0.4258103,0.01354023,0.0007488037,0.0005284096,0.005009931,0.000796428,0.1703676],"genre_scores_gemma":[0.8900778,0.002223038,0.08066598,0.001043049,0.001849436,0.0003685865,0.003453488,0.000439309,0.01987933],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01340066,"threshold_uncertainty_score":0.04482961,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01170113961706829,"score_gpt":0.2300236473121014,"score_spread":0.2183225076950331,"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."}}