{"id":"W1980190773","doi":"10.1016/j.disopt.2013.02.003","title":"A linear time algorithm for the Koopmans–Beckmann QAP linearization and related problems","year":2013,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quadratic assignment problem; Mathematics; Weapon target assignment problem; Mathematical optimization; Multiplicative function; Linearization; Assignment problem; Linear bottleneck assignment problem; Generalized assignment problem; Optimization problem; Nonlinear system","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.0005964641,0.0009809115,0.0008748844,0.0004510274,0.0006508054,0.0008654893,0.001063514,0.001186416,0.01115198],"category_scores_gemma":[0.001723881,0.0004399609,0.0006364541,0.0005912692,0.0006355503,0.001059388,0.001459813,0.00160084,0.002435826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006593842,"about_ca_system_score_gemma":0.001334585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00481877,"about_ca_topic_score_gemma":0.005070418,"domain_scores_codex":[0.9997446,0.00007393986,0.00001365993,0.00005147313,0.00008492896,0.00003131381],"domain_scores_gemma":[0.9996175,0.0002297869,0.00002257628,0.00002781868,0.00008037629,0.0000219389],"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.0001968611,0.0001511569,0.000235558,0.0002713874,0.00005174966,0.0001403988,0.0002216033,0.6259084,0.007703423,0.09119149,0.008018091,0.2659099],"study_design_scores_gemma":[0.00003206249,0.00004143654,0.00004302625,0.00001128833,0.000007882461,0.00002753444,0.00002089609,0.9801733,0.0009614065,0.0159056,0.002761433,0.00001404583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001290017,0.00006623768,0.9957215,0.00007433784,0.00004544805,0.00002812192,0.00001774526,0.0001991326,0.002557496],"genre_scores_gemma":[0.1708058,0.0002366814,0.8165635,0.0001975297,0.00008912093,0.0003631106,0.0001821706,0.0002780403,0.01128416],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01115198,"threshold_uncertainty_score":0.03730708,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005582494992715322,"score_gpt":0.1959777075951276,"score_spread":0.1903952126024123,"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."}}