{"id":"W2080943874","doi":"10.1007/s11590-015-0869-4","title":"Solving the clique partitioning problem as a maximally diverse grouping problem","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Clique; Heuristic; Variable neighborhood search; Mathematical optimization; Local search (optimization); Computer science; Mathematics; Diversification (marketing strategy); Metaheuristic; Combinatorics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089159,0.000228101,0.000176561,0.0001360988,0.0002651015,0.0002621095,0.0002578586,0.00009320794,0.00008887528],"category_scores_gemma":[0.0001501463,0.0002096598,0.00006453193,0.0005488124,0.00006668286,0.0005725059,0.00007942282,0.0002668563,0.00006373005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001989107,"about_ca_system_score_gemma":0.00004688548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003412622,"about_ca_topic_score_gemma":0.000004923193,"domain_scores_codex":[0.9984651,0.0001916229,0.0003997835,0.000230115,0.0003161139,0.0003972621],"domain_scores_gemma":[0.999212,0.0000969419,0.000117798,0.0002868251,0.000144906,0.0001414827],"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.000006757909,0.000009420481,0.0004535528,0.00002747821,0.00003091565,0.000005046744,0.001798749,0.9930032,0.0004960313,0.0009239972,0.002627791,0.0006170052],"study_design_scores_gemma":[0.0004943563,0.00002170253,0.00004265819,0.00007748095,0.00003116651,0.00002589847,0.0004291177,0.9962184,0.0003668297,0.0001641562,0.001824352,0.0003038721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005696145,0.00004460406,0.9805627,0.003028943,0.000272399,0.0004605179,0.000002559861,0.0008300917,0.009101986],"genre_scores_gemma":[0.1205873,0.00004926907,0.8763456,0.002394625,0.0002187614,0.0001234177,0.00005307517,0.0001149499,0.0001129263],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1148912,"threshold_uncertainty_score":0.854968,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02134978858238772,"score_gpt":0.2425588380450419,"score_spread":0.2212090494626542,"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."}}