{"id":"W2025661878","doi":"10.1016/j.ejor.2003.09.024","title":"Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Travelling salesman problem; Undirected graph; Combinatorics; Bottleneck traveling salesman problem; Euclidean geometry; Disjoint sets; Lin–Kernighan heuristic; Mathematics; Algorithm; Branch and cut; Hamiltonian path; Discrete mathematics; Computer science; Graph; Integer programming","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.0015246,0.001233009,0.001895506,0.001338025,0.001202903,0.001881092,0.002341104,0.002370468,0.006960054],"category_scores_gemma":[0.004612849,0.0009719632,0.001029854,0.002596785,0.001018301,0.00250482,0.001788191,0.0026643,0.00111667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001371377,"about_ca_system_score_gemma":0.00209921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007059061,"about_ca_topic_score_gemma":0.008380493,"domain_scores_codex":[0.9993539,0.0002737904,0.00002762549,0.0001218479,0.0001107091,0.0001121336],"domain_scores_gemma":[0.9973309,0.002011955,0.0002056773,0.0001243807,0.000163901,0.0001631471],"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.0003238977,0.0003937194,0.0009542196,0.0003227697,0.0001180537,0.0001361791,0.0001924565,0.7191638,0.0008146786,0.06522068,0.01446475,0.1978949],"study_design_scores_gemma":[0.00007358578,0.00004602506,0.0001478729,0.00001893333,0.00002333956,0.00002910686,0.00004220545,0.9270747,0.0002576536,0.07053316,0.00174609,0.000007306394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04752322,0.001151025,0.9337651,0.001122744,0.0001215057,0.0002237368,0.0004215406,0.000732962,0.01493826],"genre_scores_gemma":[0.2738661,0.001010198,0.7113336,0.0002716737,0.0001777553,0.0004148256,0.001189573,0.000402347,0.01133389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007059061,"threshold_uncertainty_score":0.02328372,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1034722940790199,"score_gpt":0.3671353224886715,"score_spread":0.2636630284096517,"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."}}