{"id":"W2118493070","doi":"10.1287/trsc.1100.0333","title":"Branch and Price for Service Network Design with Asset Management Constraints","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":102,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd; Université de Montréal","keywords":"Column generation; Transshipment (information security); Network planning and design; Integer programming; Computer science; Mathematical optimization; Flow network; Service (business); Operations research; Path (computing); Integer (computer science); Branch and price; Shortest path problem; Engineering; Computer network; Economics; Mathematics; Graph","routes":{"ca_aff":true,"ca_fund":true,"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.002331064,0.00167454,0.001652719,0.001619532,0.0008014579,0.001751661,0.001128866,0.001581201,0.01573647],"category_scores_gemma":[0.005442774,0.0008959472,0.0009202487,0.002873888,0.0009610568,0.001992122,0.001144872,0.002121012,0.001391376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001784308,"about_ca_system_score_gemma":0.002525994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004763636,"about_ca_topic_score_gemma":0.005437328,"domain_scores_codex":[0.9991626,0.0004403301,0.00002150208,0.00008337438,0.0001824976,0.0001097565],"domain_scores_gemma":[0.9981933,0.001422806,0.00009697256,0.00004481275,0.0001563034,0.00008566977],"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.00009892083,0.0000788204,0.0003690063,0.0001690198,0.00003663462,0.00009174264,0.00006419676,0.8434949,0.0004915308,0.08225295,0.004701293,0.068151],"study_design_scores_gemma":[0.00002057557,0.0000282537,0.00002898065,0.00001134694,0.00000763179,0.00001361425,0.000007476902,0.9749866,0.000133612,0.02264071,0.00211759,0.00000367294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008364656,0.000649143,0.9808151,0.0003611163,0.000096364,0.0001589572,0.0001088732,0.0001528428,0.00929307],"genre_scores_gemma":[0.2362221,0.00226805,0.7438763,0.0002306753,0.0002307802,0.001226935,0.0005267364,0.0002935722,0.01512486],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01573647,"threshold_uncertainty_score":0.05264372,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01866279634969389,"score_gpt":0.2654168289073473,"score_spread":0.2467540325576534,"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."}}