{"id":"W2170296950","doi":"10.1287/ijoc.1040.0128","title":"A Memetic Heuristic for the Generalized Quadratic Assignment Problem","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Quadratic assignment problem; Mathematical optimization; Heuristic; Memetic algorithm; Assignment problem; Generalized assignment problem; Generalization; Integer programming; Matrix (chemical analysis); Mathematics; Weapon target assignment problem; Computer science; Branch and bound; Linear bottleneck assignment problem; Container (type theory); Linear programming; Quadratic equation; Local search (optimization); Optimization problem; Engineering","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001289154,0.0001796903,0.0002024546,0.0001071613,0.0004187343,0.0002837433,0.0002340985,0.00005381244,0.00002004898],"category_scores_gemma":[0.0001212141,0.0001173488,0.0001217709,0.0001965625,0.00002135266,0.0001078914,0.00002551712,0.000320468,0.00001209516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001650524,"about_ca_system_score_gemma":0.00003351702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004637701,"about_ca_topic_score_gemma":0.000001127156,"domain_scores_codex":[0.9985508,0.00004333265,0.0006571367,0.00009239393,0.000289727,0.0003665878],"domain_scores_gemma":[0.9988254,0.0006645376,0.0001893261,0.0001566624,0.00009872171,0.00006538806],"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.000007714146,0.00001087163,0.00008173106,0.00003272508,0.00003830988,0.000002533853,0.0001479448,0.9730141,0.0001322231,0.001478324,0.001275865,0.02377762],"study_design_scores_gemma":[0.0007571052,0.00006915939,0.0003464642,0.00008653425,0.00003033792,0.00008455529,0.00004433519,0.9919852,0.0004268929,0.001424941,0.004572825,0.0001716544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02472335,0.0001774418,0.9720003,0.0002271408,0.0006333775,0.0003461744,0.000001468338,0.0001784456,0.001712284],"genre_scores_gemma":[0.7295361,0.0000140624,0.2693861,0.0002132133,0.0006594537,0.00001249357,0.000002988814,0.00004578429,0.0001298102],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7048128,"threshold_uncertainty_score":0.4785344,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01745726383268033,"score_gpt":0.2652813078728558,"score_spread":0.2478240440401755,"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."}}