{"id":"W2618781129","doi":"","title":"A branch-price-and-cut algorithm for the inventory-routing problem","year":2014,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Branch and cut; Mathematical optimization; Benchmark (surveying); Routing (electronic design automation); Vehicle routing problem; Computer science; Branch and price; Set (abstract data type); State (computer science); Operations research; Integer programming; Algorithm; Mathematics","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.001302481,0.001605271,0.001320659,0.001116052,0.0009119331,0.001385956,0.00182701,0.002007024,0.007563377],"category_scores_gemma":[0.003668631,0.0007024829,0.0009487818,0.00211335,0.0005291031,0.001580182,0.001046206,0.002745391,0.00121568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001728337,"about_ca_system_score_gemma":0.003076374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005625619,"about_ca_topic_score_gemma":0.006913358,"domain_scores_codex":[0.9991622,0.0002751877,0.00004036795,0.0001838294,0.0002172192,0.0001211715],"domain_scores_gemma":[0.9987493,0.000820969,0.00009257255,0.00008721352,0.0001817159,0.00006825396],"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.0001682029,0.0003098216,0.0005263106,0.0002127012,0.00007125292,0.0001198963,0.00006992249,0.7072569,0.001469899,0.03022177,0.01526652,0.2443068],"study_design_scores_gemma":[0.00006781054,0.00006769218,0.00008413475,0.00001557677,0.000018143,0.00004893586,0.00001654892,0.9820108,0.0006786605,0.01391787,0.00306496,0.000008943521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007626251,0.0003338112,0.9851035,0.0003788165,0.00009594482,0.0002737247,0.0002609775,0.0005639555,0.005362899],"genre_scores_gemma":[0.06205649,0.0003167337,0.932478,0.0001847523,0.000060981,0.0005135431,0.0008137654,0.0001915259,0.003384286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007563377,"threshold_uncertainty_score":0.02530205,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01124433631135161,"score_gpt":0.2348288068866322,"score_spread":0.2235844705752806,"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."}}