{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006876081,0.0003153536,0.0002366768,0.00009729892,0.0008930325,0.000515126,0.0008899532,0.0002415861,0.00007008337],"category_scores_gemma":[0.00008510734,0.0003284273,0.000208978,0.0004844161,0.0004098581,0.000482108,0.0005663024,0.0003949338,0.00006588553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001191058,"about_ca_system_score_gemma":0.0002826172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006396583,"about_ca_topic_score_gemma":0.00008518768,"domain_scores_codex":[0.9971894,0.00004352407,0.0006823741,0.0005424236,0.0008578045,0.0006844924],"domain_scores_gemma":[0.9979182,0.000250801,0.0006211028,0.0009142371,0.0001063177,0.0001893078],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004124919,0.00009959267,0.000004977567,0.0004232268,0.0001134155,0.00001111715,0.00495048,0.004075804,0.001675299,0.9875673,0.0004953492,0.000542197],"study_design_scores_gemma":[0.0007529827,0.0002634278,0.00004270603,0.0005136085,0.0001520946,0.0001092259,0.001259631,0.9698516,0.01362186,0.01269025,0.0003115085,0.0004310687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7568701,0.0001650617,0.2237366,0.0009277242,0.0001528596,0.0002357158,0.00009655223,0.0002091677,0.01760621],"genre_scores_gemma":[0.8873959,0.0001301552,0.1115769,0.0005164802,0.00008798955,0.0001106554,0.00005426734,0.00007456085,0.00005314976],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9748771,"threshold_uncertainty_score":0.9999168,"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."}}