{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003816299,0.001307849,0.001665658,0.001388361,0.0006464103,0.002526025,0.002419798,0.002194545,0.004708544],"category_scores_gemma":[0.02307376,0.0007975225,0.001483694,0.001811514,0.001937038,0.005993844,0.002525895,0.005464494,0.0004603425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001743067,"about_ca_system_score_gemma":0.001720572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005267399,"about_ca_topic_score_gemma":0.003255615,"domain_scores_codex":[0.9980646,0.0007889578,0.0000777028,0.0003156669,0.0005932272,0.0001599072],"domain_scores_gemma":[0.9844774,0.01348586,0.0004892137,0.0005232013,0.0008185654,0.0002057303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002230365,0.0001988747,0.001107099,0.0004667986,0.00007827018,0.00008463936,0.0002102496,0.7096916,0.000921105,0.2089502,0.007782582,0.07028548],"study_design_scores_gemma":[0.00001377376,0.00001779576,0.00009640998,0.0000201653,0.00001103971,0.00002766057,0.00002837367,0.8963659,0.0001401555,0.1021444,0.001126648,0.000007672695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01267719,0.002028512,0.9790435,0.001312694,0.0001240011,0.00004117975,0.0001138964,0.0001081897,0.004550787],"genre_scores_gemma":[0.4171942,0.005422139,0.5622953,0.0004088902,0.001110051,0.0003930505,0.0008430146,0.0003845211,0.01194888],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005267399,"threshold_uncertainty_score":0.02018273,"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."}}