{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008165037,0.0000796364,0.00007284887,0.00005250269,0.0001293953,0.00005339842,0.0001250479,0.00002713182,0.00001558327],"category_scores_gemma":[0.000008294082,0.00007527017,0.000007261023,0.0006383623,0.0001367173,0.0002444319,0.000001512273,0.00007087333,0.000001499592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000799063,"about_ca_system_score_gemma":0.00002793405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001278459,"about_ca_topic_score_gemma":0.00001804291,"domain_scores_codex":[0.9992946,0.000007706424,0.0001299912,0.0001833302,0.0001743329,0.0002100773],"domain_scores_gemma":[0.9995881,0.00008134823,0.00002860598,0.0001145817,0.000112319,0.00007505435],"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.00001094762,0.000005283304,0.002535826,0.00008036677,0.000008399174,0.000001004044,0.0004683039,0.9769722,0.006804627,0.004428421,0.0000236609,0.008660912],"study_design_scores_gemma":[0.001187247,0.00004854739,0.2822239,0.00005821504,0.0000526138,0.00000942902,0.0001242306,0.7078208,0.006314466,0.0010878,0.000667876,0.0004049588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.139117,0.000004381867,0.8596891,0.00005083644,0.0001195074,0.0003272707,0.000005574514,0.0001251284,0.0005612897],"genre_scores_gemma":[0.5239498,0.00000301,0.4759408,0.00005418114,0.00001111535,0.00002095244,0.000003600986,0.000007666361,0.000008867524],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3848329,"threshold_uncertainty_score":0.3069429,"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."}}