{"id":"W2034256646","doi":"10.1016/s0305-0548(03)00073-x","title":"Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem","year":2003,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Royal Military College of Canada","funders":"","keywords":"Cardinality (data modeling); Mathematics; Decomposition; Heuristic; Combinatorics; Variable (mathematics); Decomposition method (queueing theory); Variable neighborhood search; Mathematical optimization; Tree (set theory); Graph; Enhanced Data Rates for GSM Evolution; Tree decomposition; Algorithm; Discrete mathematics; Computer science; Metaheuristic; Line graph; Pathwidth","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.003816905,0.000159634,0.0001827545,0.0002211405,0.001128135,0.0004668498,0.000417485,0.0001057902,0.0000798234],"category_scores_gemma":[0.0001234895,0.0001349928,0.00007592802,0.001170287,0.0001007231,0.0002433125,0.00007588569,0.0004823242,0.00003725406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002336985,"about_ca_system_score_gemma":0.0001866345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003124249,"about_ca_topic_score_gemma":0.00001261809,"domain_scores_codex":[0.9974909,0.0008443543,0.0003254122,0.0003199412,0.0004385426,0.0005808604],"domain_scores_gemma":[0.9973944,0.001187778,0.000009150716,0.0005392174,0.0007412632,0.0001282036],"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.000008070286,0.00005317805,0.0001484907,0.00005383137,0.00008033384,7.665381e-7,0.0003340909,0.9033836,0.002107976,0.07962171,0.003258874,0.01094907],"study_design_scores_gemma":[0.0005101582,0.00006133725,0.0002487457,0.0000265914,0.00001407062,0.000009462725,0.00008566417,0.9875935,0.004963242,0.0008226388,0.005508711,0.0001558677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002420864,0.0002657537,0.9873503,0.000594468,0.0003190837,0.00133513,0.00001599993,0.0002196526,0.007478725],"genre_scores_gemma":[0.3331564,0.00004579474,0.6657791,0.00004509763,0.0001804817,0.0003777627,0.00005532909,0.0000535769,0.0003065162],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3307356,"threshold_uncertainty_score":0.8676818,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06097546952554979,"score_gpt":0.3698399925029928,"score_spread":0.308864522977443,"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."}}