{"id":"W3085334717","doi":"10.1080/10556788.2020.1817447","title":"Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding","year":2020,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Bounding overwatch; Travelling salesman problem; Morin; Computer science; Mathematical optimization; Mathematics; Algorithm; Artificial intelligence","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.001976123,0.001839784,0.001498535,0.001354267,0.0009767867,0.002258452,0.002349821,0.001235431,0.009079669],"category_scores_gemma":[0.007524292,0.0007440835,0.001912468,0.00171086,0.0009920412,0.003370283,0.00319675,0.00341053,0.001811324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002396481,"about_ca_system_score_gemma":0.00270569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01142028,"about_ca_topic_score_gemma":0.01436082,"domain_scores_codex":[0.9981371,0.0004650721,0.00009711341,0.0003714443,0.0005689104,0.0003603635],"domain_scores_gemma":[0.9980081,0.001002298,0.0001495315,0.0004700653,0.0002566096,0.0001134551],"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.0002211452,0.000220229,0.001130009,0.0002494891,0.00009737968,0.0001215945,0.0002786376,0.6783388,0.004549399,0.1017394,0.01191098,0.2011429],"study_design_scores_gemma":[0.00002912737,0.00002679378,0.0001020819,0.00002251344,0.00001139777,0.00001965694,0.00001751778,0.9699555,0.0007663588,0.02398295,0.005056179,0.000009880758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03725672,0.001363049,0.9309194,0.0009758616,0.0002231077,0.0001771526,0.000305923,0.002925811,0.025853],"genre_scores_gemma":[0.1961327,0.0005436771,0.7949846,0.0004555454,0.0001405127,0.000349263,0.0006601299,0.001180962,0.00555243],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01142028,"threshold_uncertainty_score":0.03037453,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02520931664539284,"score_gpt":0.301731733635452,"score_spread":0.2765224169900592,"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."}}