{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001456918,0.000196311,0.0001673776,0.0001556095,0.0006899839,0.0006165563,0.0001894196,0.00008825001,0.00001795598],"category_scores_gemma":[0.0002003715,0.0001431974,0.00005459118,0.0002726354,0.00002575623,0.0004570311,0.00001194475,0.0004268227,0.00001200866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001412582,"about_ca_system_score_gemma":0.00004885466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001489284,"about_ca_topic_score_gemma":0.000001510517,"domain_scores_codex":[0.9986491,0.00006396265,0.0005492037,0.0001438364,0.0002577887,0.0003360717],"domain_scores_gemma":[0.9985566,0.0005554102,0.0002101955,0.0001952953,0.0003563578,0.0001261924],"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.000002455114,0.000009389262,0.00009708145,0.00001171973,0.00001726221,3.343767e-7,0.0003654738,0.7539937,0.0002999023,0.00007131263,0.000173934,0.2449574],"study_design_scores_gemma":[0.000544504,0.0001689665,0.00078549,0.0001013458,0.00001242455,0.00002550437,0.0001614592,0.9968854,0.000858458,0.0000681519,0.0001964243,0.0001918436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06397974,0.00001952069,0.9343284,0.0002189495,0.0004389084,0.0005103789,0.000001966908,0.0001978492,0.0003042297],"genre_scores_gemma":[0.7023861,0.00000478737,0.2966083,0.0004273254,0.0004972949,0.00001619218,0.00001052477,0.00003838731,0.00001109165],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6384063,"threshold_uncertainty_score":0.5945467,"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."}}