{"id":"W1969909704","doi":"10.1016/j.ejor.2012.02.010","title":"A new exact discrete linear reformulation of the quadratic assignment problem","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Academy of Finland; Polytechnique Montréal; University of Pennsylvania","keywords":"Quadratic assignment problem; Linear programming; Mathematical optimization; Integer programming; Mathematics; Quadratic equation; Quadratic programming; Combinatorial optimization; Assignment problem; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001158488,0.0008647796,0.001018117,0.0005619397,0.0003427032,0.001384842,0.001677297,0.0009883543,0.01116487],"category_scores_gemma":[0.003156946,0.0004395682,0.0007445244,0.001080423,0.0008086482,0.002067989,0.001645852,0.00255212,0.001712889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007154342,"about_ca_system_score_gemma":0.001063869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002082646,"about_ca_topic_score_gemma":0.002491053,"domain_scores_codex":[0.9991387,0.0003079988,0.00003038689,0.0001618094,0.0002920124,0.00006899873],"domain_scores_gemma":[0.9993309,0.0003047631,0.00006070109,0.0001027343,0.0001524453,0.0000484681],"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.0001175911,0.0002326719,0.0002520968,0.0003307824,0.0000349669,0.000112136,0.0001129887,0.4760481,0.00359424,0.3736064,0.02058583,0.1249723],"study_design_scores_gemma":[0.00002509713,0.00005763486,0.00007001427,0.00001536666,0.000007037827,0.00004720927,0.00001903449,0.9341146,0.0003222374,0.05780264,0.007509293,0.000009795238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002724396,0.0001367399,0.9890863,0.0002781271,0.0001760681,0.00003188301,0.000126944,0.00006482534,0.007374688],"genre_scores_gemma":[0.1900007,0.0007968405,0.7758136,0.0006737884,0.0007121685,0.0002948561,0.0010292,0.0003773736,0.03030154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01116487,"threshold_uncertainty_score":0.03735024,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08035879040295515,"score_gpt":0.3671476523560229,"score_spread":0.2867888619530677,"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."}}