{"id":"W2165941447","doi":"10.1016/j.cor.2012.04.003","title":"Lower and upper bounds for the two-echelon capacitated location-routing problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":166,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Heuristics; Mathematical optimization; Computer science; Vehicle routing problem; Heuristic; Upper and lower bounds; Branch and bound; Routing (electronic design automation); Set (abstract data type); Neighbourhood (mathematics); Mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004913009,0.002791303,0.002167281,0.003874598,0.001392145,0.006430734,0.004573725,0.003204289,0.01910477],"category_scores_gemma":[0.0222892,0.0009176754,0.001974544,0.004669451,0.001884605,0.00782499,0.003681014,0.006105624,0.003425587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003903175,"about_ca_system_score_gemma":0.00242254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00239506,"about_ca_topic_score_gemma":0.003059901,"domain_scores_codex":[0.9948626,0.001304126,0.0002305883,0.0007176233,0.002037156,0.0008479159],"domain_scores_gemma":[0.9842544,0.01191739,0.0009355734,0.0009056041,0.001426975,0.000560069],"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.0002305811,0.0002851126,0.0008410559,0.0008588482,0.0001058608,0.0001995425,0.0001833226,0.5985916,0.001882004,0.2898446,0.01841914,0.08855828],"study_design_scores_gemma":[0.00003888922,0.00008149373,0.0004080408,0.0002044715,0.00004335452,0.0001966534,0.00008968927,0.8198891,0.001298279,0.1654892,0.01221844,0.00004237551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01295124,0.007423044,0.9088476,0.003057393,0.0005470305,0.0001975266,0.00114592,0.0005805526,0.06524971],"genre_scores_gemma":[0.3988202,0.01067627,0.5597091,0.001304827,0.00165752,0.001309305,0.003531307,0.001147188,0.02184408],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01910477,"threshold_uncertainty_score":0.06391186,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07168323218806766,"score_gpt":0.3734654080494779,"score_spread":0.3017821758614102,"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."}}