{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006469304,0.00007973229,0.0001183598,0.0001322404,0.0001208555,0.00004740053,0.0002904842,0.00001932091,0.0001704119],"category_scores_gemma":[0.0005021537,0.00005132693,0.00006783713,0.0003310815,0.00003662112,0.0003898591,0.00006716674,0.0004290664,0.00002564596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001293261,"about_ca_system_score_gemma":0.0001413785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002272529,"about_ca_topic_score_gemma":3.604747e-7,"domain_scores_codex":[0.9970816,0.001163719,0.0005376035,0.00005700561,0.0009391898,0.0002208519],"domain_scores_gemma":[0.9990082,0.0001886151,0.0001075466,0.0001642826,0.0003865342,0.0001448003],"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.00003211007,0.00003972838,0.003391901,0.00004223644,0.00006241017,0.000002930698,0.001636903,0.9535112,0.02887193,0.002089355,0.002844105,0.007475217],"study_design_scores_gemma":[0.003745191,0.001002822,0.2505887,0.001151692,0.00008428235,0.0002992416,0.0007472865,0.6235558,0.08027538,0.0005641452,0.03727231,0.0007131194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1457097,0.0005570773,0.8246397,0.001581978,0.0005053226,0.0004356234,0.000005667658,0.00002968114,0.02653525],"genre_scores_gemma":[0.8757239,0.00002188433,0.123093,0.00001293431,0.0004857893,7.429945e-7,0.000001712034,0.00002858456,0.0006314344],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7300141,"threshold_uncertainty_score":0.2242144,"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."}}