{"id":"W1969579058","doi":"10.1287/trsc.1040.0106","title":"The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm","year":2005,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Arc routing; Column generation; Mathematical optimization; Minimum-cost flow problem; Profit (economics); Integer programming; Limiting; Directed graph; Arc (geometry); Branch and price; Mathematics; Graph; Computer science; Flow network; Algorithm; Routing (electronic design automation); Economics; Engineering; Combinatorics","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":[],"consensus_categories":[],"category_scores_codex":[0.0007940785,0.00008845321,0.0000700029,0.00006058588,0.0003671024,0.00009386145,0.0001552475,0.00002396444,0.00001078236],"category_scores_gemma":[0.00001302401,0.0000639808,0.00001151116,0.0007045352,0.0001924548,0.0005811567,0.000002431368,0.00009404602,0.000007334153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004570938,"about_ca_system_score_gemma":0.00006245802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001267032,"about_ca_topic_score_gemma":0.00008075431,"domain_scores_codex":[0.9990262,0.0000142064,0.0001800318,0.0001836743,0.0003266303,0.0002692672],"domain_scores_gemma":[0.9995896,0.00004822227,0.00003879891,0.0001336818,0.0001187518,0.00007093185],"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.00001162841,0.00001764301,0.002787569,0.00004052712,0.00001122115,0.000001123159,0.003181513,0.6802675,0.01711953,0.002608245,0.00009373059,0.2938598],"study_design_scores_gemma":[0.0004007931,0.00003346771,0.05756455,0.00003019538,0.00001443105,0.00000769164,0.000107308,0.9277228,0.01091617,0.000216465,0.002775228,0.0002109157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08145272,0.0001186533,0.9160178,0.0004242458,0.00005349429,0.0002457756,0.000003560614,0.0002412304,0.001442502],"genre_scores_gemma":[0.6349766,0.00003645447,0.3647024,0.00003073175,0.00002627518,0.00002780533,0.000002354126,0.00001148573,0.0001859287],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5535238,"threshold_uncertainty_score":0.2823492,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01144653696080883,"score_gpt":0.249086160234552,"score_spread":0.2376396232737432,"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."}}