{"id":"W2325136417","doi":"10.1287/ijoc.2015.0683","title":"Branch-and-Price for Personalized Multiactivity Tour Scheduling","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; Polytechnique Montréal","funders":"","keywords":"Scheduling (production processes); Computer science; Time horizon; Mathematical optimization; Shortest path problem; Upper and lower bounds; Context (archaeology); Path (computing); Mathematics; Theoretical computer science; Graph","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":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.006466838,0.0001763225,0.0003411034,0.0003704564,0.0009833942,0.0005819072,0.000439295,0.00008989891,0.00008436874],"category_scores_gemma":[0.01612694,0.00009346228,0.0002626052,0.0003606357,0.0001007881,0.0006683556,0.00009992692,0.0003111305,0.0001286092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008357281,"about_ca_system_score_gemma":0.0001451548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004270763,"about_ca_topic_score_gemma":0.000001622369,"domain_scores_codex":[0.9974956,0.00007677125,0.000747911,0.0002987697,0.0008669556,0.0005140071],"domain_scores_gemma":[0.9907363,0.00757977,0.0005879942,0.0002488721,0.0005632632,0.0002837663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002897003,0.00008439391,0.01113169,0.000007986353,0.000106714,0.000007200347,0.001115529,0.007569947,0.002713928,0.01202979,0.0007398936,0.9642032],"study_design_scores_gemma":[0.02324618,0.001479992,0.06777325,0.001922134,0.0001556886,0.001595401,0.002442513,0.5044488,0.006719821,0.1481754,0.2396709,0.002369984],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5115796,0.00008067006,0.4856486,0.001472315,0.0006482649,0.00008292182,0.000004413861,0.00003982824,0.0004433646],"genre_scores_gemma":[0.9668285,0.00001276938,0.03107443,0.0004913585,0.0006354169,0.000001758093,2.699042e-7,0.00001338216,0.0009421428],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9618332,"threshold_uncertainty_score":0.9921606,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.118641447980974,"score_gpt":0.3939368776368291,"score_spread":0.2752954296558551,"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."}}