{"id":"W3022257994","doi":"","title":"Selective pricing in branch-price-and-cut algorithms for vehicle routing","year":2016,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Heuristic; Column generation; Context (archaeology); Branch and cut; Branch and bound; Branch and price; Path (computing); Computer science; Mathematics; Routing (electronic design automation); Algorithm; Integer programming","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.001846121,0.001020482,0.0009343169,0.0008051904,0.0008710469,0.001015291,0.001571735,0.001076674,0.003671961],"category_scores_gemma":[0.004575764,0.0006404845,0.0008304082,0.001855175,0.0009198652,0.002170529,0.001174936,0.002187068,0.0007432462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001430554,"about_ca_system_score_gemma":0.00187004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003944313,"about_ca_topic_score_gemma":0.004754888,"domain_scores_codex":[0.9987795,0.0005510864,0.00004517446,0.0001445872,0.0003203161,0.0001594686],"domain_scores_gemma":[0.9982631,0.001237071,0.000104493,0.0001851823,0.0001471922,0.00006305333],"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.0001397781,0.0001811653,0.0005377998,0.0001568607,0.00004405954,0.00006751645,0.0001015244,0.7553434,0.002697637,0.08192019,0.004087996,0.154722],"study_design_scores_gemma":[0.00002489213,0.00004526936,0.00007418792,0.000008886716,0.00001087192,0.000022761,0.00001491733,0.968834,0.001028257,0.02757085,0.002359564,0.000005588898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01108951,0.0002869639,0.9842174,0.0001914484,0.00003467967,0.0001028685,0.00004299956,0.0002602581,0.003773918],"genre_scores_gemma":[0.2097034,0.0005820645,0.7849162,0.0001972105,0.00007025662,0.0004792825,0.0002948915,0.0002345567,0.003522147],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003944313,"threshold_uncertainty_score":0.01228398,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01219102922551219,"score_gpt":0.2472849159861907,"score_spread":0.2350938867606785,"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."}}