{"id":"W2602684069","doi":"10.1016/j.ejor.2018.01.054","title":"The quadratic shortest path problem: complexity, approximability, and solution methods","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"Air Force Office of Scientific Research; Air Force Materiel Command; U.S. Air Force; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Shortest path problem; Quadratic equation; Mathematical optimization; Combinatorics; Regular polygon; Function (biology); Approximation algorithm; 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":[],"consensus_categories":[],"category_scores_codex":[0.02450677,0.0001024283,0.0001402498,0.0001310274,0.0007189055,0.0003716837,0.0003467525,0.00002246566,0.0000550285],"category_scores_gemma":[0.001609078,0.00007199962,0.0000393263,0.0003376415,0.0006237324,0.0002436971,0.0001455582,0.000557837,0.00002428564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008894325,"about_ca_system_score_gemma":0.0001106785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002225141,"about_ca_topic_score_gemma":0.000004571044,"domain_scores_codex":[0.9945925,0.003787278,0.0005536562,0.0001323866,0.0006498239,0.0002843611],"domain_scores_gemma":[0.9973733,0.00096316,0.00006450644,0.0001906129,0.001270513,0.000137865],"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.0004119663,0.0004513626,0.00616143,0.0002835273,0.0005677846,0.000115503,0.009105756,0.1154027,0.138672,0.1167132,0.03584516,0.5762695],"study_design_scores_gemma":[0.0007238874,0.0007990355,0.01975932,0.0001133173,0.00001644252,0.0003072649,0.0002841874,0.9510745,0.002240089,0.005493329,0.01895005,0.0002385655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04039286,0.0005916156,0.9337512,0.002378482,0.0002902903,0.0003151002,0.000003527593,0.00004717208,0.02222979],"genre_scores_gemma":[0.5202755,0.00009239445,0.4789783,0.00002241954,0.0004380543,0.000002326876,0.000001704822,0.00002917679,0.0001601238],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8356718,"threshold_uncertainty_score":0.8493605,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1657774080792345,"score_gpt":0.4255515052571589,"score_spread":0.2597740971779244,"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."}}