{"id":"W2156398306","doi":"10.1002/net.21459","title":"A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Pickup; Stack (abstract data type); Computer science; Constraint (computer-aided design); Algorithm; 2-opt; Branch and cut; Mathematical optimization; Mathematics; Integer programming; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.001128426,0.001274565,0.001665179,0.001271811,0.001131122,0.001385901,0.001608947,0.0020471,0.007487654],"category_scores_gemma":[0.002653646,0.0008374311,0.000853244,0.002031551,0.0005477559,0.001842706,0.001083736,0.001758203,0.0009489363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001410665,"about_ca_system_score_gemma":0.00197871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00690271,"about_ca_topic_score_gemma":0.005449513,"domain_scores_codex":[0.9994443,0.000185971,0.00002741539,0.0001146858,0.0001143317,0.0001132132],"domain_scores_gemma":[0.9988891,0.0007888373,0.00007630781,0.00004724775,0.0001132746,0.00008521913],"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.0003363929,0.0004002101,0.0006706331,0.0002090098,0.00009425807,0.0001869274,0.0001228432,0.7546445,0.001453262,0.02004072,0.009705349,0.2121358],"study_design_scores_gemma":[0.00008119854,0.00007475126,0.0001029427,0.00001276611,0.0000162707,0.00003612453,0.00002671354,0.9882754,0.000409718,0.009584581,0.001372215,0.000007364784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0681204,0.001092456,0.9185435,0.0006683603,0.0001371296,0.0003979673,0.0004156766,0.0009194236,0.009705156],"genre_scores_gemma":[0.1572109,0.0005199659,0.8367715,0.0001239076,0.00007441462,0.0004048744,0.0009405427,0.0001922031,0.003761708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007487654,"threshold_uncertainty_score":0.02504867,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01037015660828235,"score_gpt":0.1923077332894443,"score_spread":0.1819375766811619,"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."}}