{"id":"W2120930954","doi":"10.1287/ijoc.2013.0549","title":"An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem","year":2013,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":115,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; HEC Montréal; Université du Québec à Montréal","funders":"","keywords":"Column generation; Mathematical optimization; Column (typography); Computer science; Routing (electronic design automation); Set (abstract data type); Upper and lower bounds; Path (computing); Shortest path problem; Enumeration; Vehicle routing problem; Mathematics; Algorithm; Theoretical computer science; Combinatorics","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.0007503183,0.001549854,0.00108942,0.0011546,0.0008848226,0.001214408,0.00158421,0.001173371,0.01068293],"category_scores_gemma":[0.002599311,0.0006992479,0.0009669454,0.001791313,0.0006598061,0.00182382,0.001085606,0.001779284,0.00188261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001371009,"about_ca_system_score_gemma":0.002287284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005325647,"about_ca_topic_score_gemma":0.006547489,"domain_scores_codex":[0.9992024,0.0001966429,0.00003586745,0.0001655258,0.000247371,0.0001521805],"domain_scores_gemma":[0.9987881,0.0007014324,0.0000826563,0.000223805,0.0001642778,0.00003976952],"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.0002515863,0.0003268795,0.000648673,0.0003311379,0.00007631815,0.0001699031,0.0001164751,0.5191582,0.005937851,0.04062962,0.01538812,0.4169652],"study_design_scores_gemma":[0.000086137,0.00006848846,0.0001347785,0.00001880378,0.00002192006,0.0001473014,0.00003623622,0.969543,0.002273621,0.02367409,0.003975893,0.00001980286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004872593,0.0001391266,0.9902126,0.0001278026,0.00005282523,0.0001418187,0.0001715309,0.001153941,0.003127825],"genre_scores_gemma":[0.06460728,0.000153267,0.9324076,0.0001144254,0.00002979556,0.0002386633,0.0007871323,0.0002209005,0.001440896],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01068293,"threshold_uncertainty_score":0.03573799,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0231427117613517,"score_gpt":0.269702066190119,"score_spread":0.2465593544287673,"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."}}