{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002795647,0.00012655,0.0001050416,0.0002503863,0.000647045,0.0004068797,0.000311226,0.00004941549,0.00002246621],"category_scores_gemma":[0.0002941238,0.0001004438,0.00003739996,0.001268151,0.00006995493,0.0001418852,0.00003105876,0.0004934729,0.00009373141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001233166,"about_ca_system_score_gemma":0.00005146365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002334711,"about_ca_topic_score_gemma":0.00002265882,"domain_scores_codex":[0.9979907,0.0005305676,0.0002318715,0.0002554177,0.0004402128,0.000551217],"domain_scores_gemma":[0.9992121,0.0001282463,0.000005400654,0.0003858409,0.0001394119,0.0001289307],"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":[8.150098e-7,0.00002286185,0.00003450424,0.0000197073,0.00001650306,9.135455e-7,0.001521868,0.9792521,0.008152109,0.003131356,0.001805471,0.006041783],"study_design_scores_gemma":[0.0002080116,0.00002289685,0.00008741408,0.00002803643,0.000006021858,0.00001539606,0.000530001,0.9336976,0.003879338,0.00002080828,0.06125622,0.0002482732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02270816,0.00004779713,0.9650635,0.002528223,0.00007550878,0.001201729,0.00000329087,0.0002066858,0.008165152],"genre_scores_gemma":[0.2750981,0.000009502074,0.7235469,0.000262578,0.00008673294,0.00059323,0.00001143182,0.00005359836,0.0003380219],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2523899,"threshold_uncertainty_score":0.4976613,"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."}}