{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001859798,0.0003141756,0.0003131235,0.0001828144,0.0003632271,0.0002031937,0.0004000846,0.0002252218,0.00001151053],"category_scores_gemma":[0.0003330689,0.0002750722,0.0001295726,0.0003921153,0.00007437513,0.00020331,0.000120287,0.0003724035,0.000005441135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002011704,"about_ca_system_score_gemma":0.00004274335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000454634,"about_ca_topic_score_gemma":0.0001622081,"domain_scores_codex":[0.998183,0.0001380003,0.000447994,0.0003280655,0.0002227016,0.0006802771],"domain_scores_gemma":[0.9984709,0.0005445728,0.0001228757,0.0005687397,0.00009621326,0.0001967237],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001366853,0.00004479121,0.004017574,0.0001358518,0.0001274868,0.000001801283,0.0006722058,0.203434,0.002920191,0.01774886,0.002221723,0.7686619],"study_design_scores_gemma":[0.0004579672,0.00004566712,0.001471877,0.00004501416,0.00004241012,0.00003126579,0.0000373406,0.9843205,0.00316913,0.002518046,0.007539422,0.0003213459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003237637,0.0007966826,0.9914518,0.001142389,0.0001727964,0.001005237,0.00001606397,0.001497358,0.0006800192],"genre_scores_gemma":[0.225541,0.000153102,0.7718447,0.0008550879,0.0003040658,0.00082214,0.0000101445,0.0001439882,0.0003257564],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7808865,"threshold_uncertainty_score":0.9999701,"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."}}