{"id":"W2158175311","doi":"10.1287/opre.51.6.940.24921","title":"A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":87,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Branch and cut; Linear programming relaxation; Mathematical optimization; Facet (psychology); Relaxation (psychology); Undirected graph; Integer programming; Mathematics; Integer (computer science); Linear programming; Algorithm; Polyhedron; Travelling salesman problem; Computer science; Combinatorics; 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.001027334,0.001274409,0.001256006,0.001151622,0.001006938,0.001198695,0.001433893,0.001412921,0.006909369],"category_scores_gemma":[0.002994783,0.0006457016,0.000764469,0.00201012,0.0005344141,0.00180727,0.001281846,0.001890634,0.001189399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001023368,"about_ca_system_score_gemma":0.001855961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00552489,"about_ca_topic_score_gemma":0.005769484,"domain_scores_codex":[0.9992276,0.0002486044,0.00004077108,0.0001553901,0.0002137821,0.0001138382],"domain_scores_gemma":[0.9989938,0.000689729,0.0000707988,0.00006200468,0.0001428008,0.00004078561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001785475,0.0003365034,0.0007003996,0.0003013257,0.00009033507,0.000234856,0.0001844271,0.4128704,0.003430849,0.04547686,0.0137106,0.5224849],"study_design_scores_gemma":[0.00008575123,0.0000949625,0.0001516427,0.00002330523,0.00003179377,0.0001033907,0.00005109317,0.9675001,0.001313407,0.02460618,0.006023452,0.00001494927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006213449,0.0001810646,0.9888493,0.0001562118,0.00002681438,0.0001787884,0.0001210963,0.0004422725,0.003831001],"genre_scores_gemma":[0.04264613,0.0002396015,0.9538494,0.00009280677,0.00002577748,0.0003378311,0.000582458,0.0001802546,0.002045745],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006909369,"threshold_uncertainty_score":0.02311414,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06787206902597621,"score_gpt":0.3684388767560152,"score_spread":0.300566807730039,"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."}}