{"id":"W2033097589","doi":"10.1016/j.orl.2003.08.005","title":"A bilevel programming approach to the travelling salesman problem","year":2003,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Travelling salesman problem; Bilevel optimization; Mathematical optimization; Extension (predicate logic); Linear programming relaxation; Computer science; Relaxation (psychology); Toll; Linear programming; Dual (grammatical number); Optimization problem; Mathematics","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.00113371,0.0008764376,0.001524436,0.001021874,0.0007943401,0.002510528,0.001751737,0.001760927,0.00386088],"category_scores_gemma":[0.003474673,0.0007685214,0.001154021,0.002568156,0.001309123,0.002412757,0.002146707,0.003231017,0.0009153857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008962934,"about_ca_system_score_gemma":0.001787589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003655287,"about_ca_topic_score_gemma":0.002699037,"domain_scores_codex":[0.9992219,0.0003565532,0.00003399279,0.00009990026,0.0002152832,0.00007240668],"domain_scores_gemma":[0.9993356,0.0003955421,0.00005443603,0.00003510822,0.0001353983,0.00004386615],"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.00002722829,0.00006153806,0.0001577235,0.0001324448,0.00004641067,0.00008186804,0.0001229093,0.528404,0.0005627473,0.420754,0.002122953,0.04752617],"study_design_scores_gemma":[0.0000106529,0.00002226384,0.00003689251,0.00002130686,0.00001194143,0.00002696196,0.00003274573,0.7623276,0.0001651728,0.2325595,0.004772835,0.00001219753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002090866,0.0005093387,0.992547,0.0003646846,0.00005535883,0.00001415533,0.00002423352,0.00002799308,0.004366348],"genre_scores_gemma":[0.2390622,0.005014163,0.7299038,0.0002787389,0.0004809849,0.0002924856,0.0002333641,0.0002066444,0.02452769],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00386088,"threshold_uncertainty_score":0.01291597,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07996579037548483,"score_gpt":0.3380938230751212,"score_spread":0.2581280326996364,"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."}}