{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001188081,0.0005027158,0.001568883,0.0009985688,0.0004996715,0.0009670795,0.001280138,0.001262991,0.002974103],"category_scores_gemma":[0.003712937,0.0005134147,0.0005979175,0.00114938,0.0005897046,0.001485383,0.001037803,0.001182359,0.0003240253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007823932,"about_ca_system_score_gemma":0.0008808668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003496449,"about_ca_topic_score_gemma":0.004409967,"domain_scores_codex":[0.9994975,0.0002686986,0.00001564679,0.00006724222,0.00008705508,0.00006384459],"domain_scores_gemma":[0.9985968,0.001052671,0.0001150812,0.00005500278,0.00009700974,0.00008332622],"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.0002310707,0.0001523938,0.0009863956,0.0001261515,0.0000606125,0.00006300394,0.00007096679,0.9125973,0.0008674994,0.02682786,0.003901821,0.05411498],"study_design_scores_gemma":[0.00002280067,0.00001885,0.00007061302,0.000006402652,0.000005451197,0.000009925677,0.00001456317,0.9922532,0.00008400936,0.007279875,0.0002317627,0.000002489925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1509118,0.0009443058,0.8386717,0.0008524053,0.00007679674,0.00009575627,0.0003044792,0.0003077542,0.007835101],"genre_scores_gemma":[0.5602161,0.0003306459,0.4336942,0.0001654638,0.00006014552,0.0002324067,0.0006025434,0.0001466253,0.004551888],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003496449,"threshold_uncertainty_score":0.009949327,"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."}}