{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003522883,0.002971921,0.004061852,0.002993619,0.002008955,0.004467258,0.004329426,0.004368691,0.009658637],"category_scores_gemma":[0.009763055,0.002813678,0.003014998,0.005961609,0.003232838,0.006441248,0.002433333,0.005773183,0.001755552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003278224,"about_ca_system_score_gemma":0.00341902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0114583,"about_ca_topic_score_gemma":0.007125769,"domain_scores_codex":[0.9981949,0.0006413171,0.00006112418,0.0002765119,0.0006294053,0.000196781],"domain_scores_gemma":[0.9963606,0.002786933,0.0002407327,0.0001328533,0.0003301725,0.0001486654],"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.0001135224,0.0001930414,0.0002062476,0.0002321636,0.00005850388,0.00005636349,0.00008366455,0.795244,0.0004667885,0.1551543,0.006120426,0.04207089],"study_design_scores_gemma":[0.0000238968,0.00002799303,0.00005007846,0.00003887941,0.00002293524,0.00002552781,0.00002017041,0.9190938,0.0002196166,0.0786225,0.00184167,0.00001298128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003617407,0.001031496,0.9851953,0.0005012313,0.000120234,0.00009887171,0.0001263492,0.00008429473,0.009224836],"genre_scores_gemma":[0.1203651,0.004571186,0.8563206,0.0003572946,0.0004193806,0.0006432474,0.0005683586,0.0003642094,0.0163906],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0114583,"threshold_uncertainty_score":0.03231138,"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."}}