{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008541331,0.0007865989,0.0009386087,0.0007130023,0.0005401573,0.001096257,0.001152719,0.001697507,0.008733722],"category_scores_gemma":[0.002280955,0.0005011136,0.000527952,0.001406067,0.0005459579,0.001596332,0.001018647,0.001405317,0.0009599531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000731395,"about_ca_system_score_gemma":0.001821329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003409056,"about_ca_topic_score_gemma":0.003861346,"domain_scores_codex":[0.9996165,0.0001414336,0.00001338009,0.00006009713,0.0001033796,0.0000651056],"domain_scores_gemma":[0.9994534,0.0003946917,0.00002949508,0.0000304425,0.00005377041,0.00003825262],"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.0001385088,0.0001647654,0.0005004652,0.000139417,0.00003568272,0.0001552337,0.000115052,0.762706,0.001343348,0.06698706,0.008985316,0.1587292],"study_design_scores_gemma":[0.00003913943,0.00002773613,0.00005068783,0.000007821573,0.00000615962,0.00003160094,0.00001678803,0.9734687,0.0002623579,0.02411031,0.001973955,0.000004748532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01030419,0.0002024093,0.9820338,0.0003505921,0.00003770809,0.0001289092,0.0000843296,0.0003363008,0.006521759],"genre_scores_gemma":[0.1088076,0.0003618483,0.8848064,0.0001019407,0.00006531037,0.0003443565,0.0002268671,0.0001589572,0.005126708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008733722,"threshold_uncertainty_score":0.02921718,"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."}}