{"id":"W2036433802","doi":"10.1016/j.dam.2009.03.003","title":"Counting feasible solutions of the traveling salesman problem with pickups and deliveries is <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>#</mml:mi><mml:mi>P</mml:mi></mml:math>-complete","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; HEC Montréal","funders":"","keywords":"Travelling salesman problem; Mathematics; Combinatorics; Algorithm; Mathematical optimization; Discrete mathematics","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.004287424,0.003005419,0.003209218,0.00331695,0.001886864,0.00870277,0.004534999,0.003352948,0.02875601],"category_scores_gemma":[0.02449289,0.002030307,0.003168169,0.007647394,0.001694177,0.009874096,0.002182351,0.003633755,0.003698264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003276949,"about_ca_system_score_gemma":0.004601534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005136601,"about_ca_topic_score_gemma":0.00786577,"domain_scores_codex":[0.995829,0.001356365,0.0003646522,0.001017766,0.0008766826,0.0005555045],"domain_scores_gemma":[0.9835127,0.01245,0.001551321,0.0009364336,0.0009789781,0.0005704837],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007822092,0.0005829721,0.004123009,0.002063245,0.0004407722,0.0004013215,0.0004828791,0.2533716,0.002247386,0.5295867,0.04819286,0.1577251],"study_design_scores_gemma":[0.0001936055,0.0001589009,0.001042003,0.0001913821,0.0001465426,0.0002210127,0.0001881654,0.3132518,0.00237159,0.670446,0.01171201,0.00007703314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.110923,0.001508124,0.7842514,0.005852969,0.0002886124,0.000992765,0.01699941,0.001554028,0.07762969],"genre_scores_gemma":[0.3330207,0.002233498,0.595156,0.0005337304,0.000348412,0.001691108,0.02119127,0.001109934,0.04471541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02875601,"threshold_uncertainty_score":0.09619838,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02324561272859016,"score_gpt":0.2381692861386059,"score_spread":0.2149236734100158,"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."}}