{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002016264,0.00008210279,0.00008760452,0.00009493506,0.0006581249,0.0001969891,0.0001166573,0.00006047489,0.00008011865],"category_scores_gemma":[0.0004442104,0.0000648464,0.00002566032,0.000532081,0.00006521717,0.0001020817,0.00001747252,0.0002675823,0.00001402681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005053463,"about_ca_system_score_gemma":0.00006915065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002740695,"about_ca_topic_score_gemma":0.00005427203,"domain_scores_codex":[0.9989259,0.0002279496,0.0001664952,0.0001585452,0.0002108887,0.0003102186],"domain_scores_gemma":[0.9989175,0.0005269337,0.000003996038,0.0002019382,0.0002866625,0.00006296015],"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.00000214109,0.00002265104,0.00002508469,0.00003174483,0.00005246371,5.551806e-7,0.0009748727,0.8476787,0.006109595,0.005934585,0.0006083762,0.1385593],"study_design_scores_gemma":[0.0002778983,0.00001858032,0.00004553864,0.00001110808,0.000005928901,0.000005767238,0.0001540413,0.9828864,0.006698912,0.0001764035,0.009635757,0.00008364677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004063582,0.0004594343,0.9917291,0.0004815166,0.00007798432,0.0008549297,0.00001420073,0.0001242939,0.002194959],"genre_scores_gemma":[0.1515124,0.000269061,0.8439275,0.00003323811,0.0001131969,0.0007462431,0.00001804197,0.00006743878,0.003312859],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1478016,"threshold_uncertainty_score":0.5061831,"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."}}