{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074309,0.00008911714,0.0001161302,0.0001443788,0.0003123849,0.0001834007,0.0002155094,0.00001891603,0.00008157267],"category_scores_gemma":[0.00111149,0.00006322371,0.00004662828,0.0002704108,0.00009335148,0.0001392324,0.00002255809,0.0004048208,0.00001596584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000543572,"about_ca_system_score_gemma":0.00009944374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.537138e-7,"about_ca_topic_score_gemma":7.802066e-7,"domain_scores_codex":[0.9977983,0.001054802,0.0003641841,0.00009845476,0.0004505868,0.0002336955],"domain_scores_gemma":[0.9981908,0.0008497134,0.00004035982,0.000114659,0.0007023225,0.0001022056],"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.00008284787,0.00008487258,0.0006620449,0.0001287199,0.0003045804,0.00005580567,0.002072491,0.8822865,0.02069849,0.01703836,0.01118461,0.06540061],"study_design_scores_gemma":[0.005090247,0.001043582,0.01907562,0.0003290943,0.00007877154,0.001096198,0.0006019346,0.6739308,0.01528512,0.001861474,0.2809001,0.0007071216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05425559,0.002672622,0.912051,0.002320169,0.0005860541,0.0007974455,0.00001430409,0.00008171145,0.02722109],"genre_scores_gemma":[0.8278044,0.0003236561,0.1705144,0.00005261018,0.0003120163,0.000009272298,0.000003202208,0.0000676595,0.0009127875],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7735488,"threshold_uncertainty_score":0.2578188,"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."}}