{"id":"W2119673940","doi":"10.1007/s10107-008-0234-9","title":"The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Pickup; Vertex (graph theory); Mathematics; Branch and cut; Bottleneck traveling salesman problem; Algorithm; Dimension (graph theory); Graph; Polytope; Combinatorics; Integer programming; Mathematical optimization; Computer science","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.0005366976,0.0001792664,0.0002132627,0.0000320962,0.0003565142,0.0001344615,0.0000700516,0.00007090517,0.000001133842],"category_scores_gemma":[0.00009357618,0.0001227931,0.00001942073,0.0001380096,0.0002500841,0.0001040921,0.00005007014,0.0002030032,0.000001896544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001648879,"about_ca_system_score_gemma":0.00001110298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005981047,"about_ca_topic_score_gemma":0.000005017813,"domain_scores_codex":[0.9989334,0.00004873985,0.0003036447,0.0002154617,0.0001693917,0.0003294124],"domain_scores_gemma":[0.9992664,0.000379609,0.00004299599,0.0001493278,0.00003404936,0.0001276326],"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.00004484157,0.00004345289,0.0005547215,0.0004275445,0.0001088486,0.00003277033,0.007087423,0.001296541,0.0001960608,0.002483635,0.00002383551,0.9877003],"study_design_scores_gemma":[0.001690322,0.0001866066,0.001002973,0.0003216783,0.00007580304,0.0009776293,0.0005298785,0.9901802,0.0004469562,0.003088413,0.001004777,0.0004947645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3560822,0.000829045,0.6408272,0.0003034765,0.00002707712,0.0006277902,0.000003402932,0.0004894725,0.0008103335],"genre_scores_gemma":[0.4095145,0.0001072803,0.5902115,0.00001124631,0.00003290287,0.00002658046,0.000001620118,0.00003552372,0.00005894955],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9888837,"threshold_uncertainty_score":0.5007356,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01627718973430905,"score_gpt":0.2294317008849779,"score_spread":0.2131545111506688,"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."}}