{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003016782,0.001611393,0.0023425,0.001353394,0.001145727,0.001717618,0.002210498,0.002170173,0.01242787],"category_scores_gemma":[0.00471035,0.001034796,0.001376812,0.002465797,0.0009938404,0.002582415,0.001441509,0.002974043,0.001340114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00224052,"about_ca_system_score_gemma":0.003203423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007543253,"about_ca_topic_score_gemma":0.008522831,"domain_scores_codex":[0.9985676,0.0006757454,0.00005422193,0.0001838835,0.0002761401,0.0002424827],"domain_scores_gemma":[0.9969659,0.002385981,0.0001587341,0.0001575335,0.0001359023,0.0001958625],"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.0001427135,0.0001730859,0.0003738179,0.000151389,0.00005366641,0.00008193825,0.00007969148,0.906763,0.0005617092,0.02801907,0.003637034,0.05996288],"study_design_scores_gemma":[0.00003140036,0.00004492436,0.00005635847,0.000008730331,0.000009452639,0.0000155378,0.00001604511,0.9810616,0.0001605006,0.01742148,0.001168069,0.000005839073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02446549,0.0007912058,0.9641252,0.0005848135,0.000121341,0.0002962611,0.0002126441,0.000864805,0.008538282],"genre_scores_gemma":[0.3169517,0.0007468643,0.6726955,0.0002939582,0.0001567483,0.0006889616,0.0007714697,0.0005286675,0.007166086],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01242787,"threshold_uncertainty_score":0.04157537,"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."}}