{"id":"W2236520910","doi":"10.1016/j.tcs.2016.01.002","title":"Solving the Many to Many assignment problem by improving the Kuhn–Munkres algorithm with backtracking","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":117,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; Nipissing University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Backtracking; Algorithm; Task (project management); Assignment problem; Computer science; Mathematics; Process (computing); Mathematical optimization","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.001489414,0.00134993,0.002208692,0.001773705,0.001741948,0.00148588,0.002806198,0.002129215,0.009872815],"category_scores_gemma":[0.004587865,0.0008909812,0.00110336,0.002581757,0.001571948,0.003413467,0.002041216,0.002961449,0.002199804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000956195,"about_ca_system_score_gemma":0.002537266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005335957,"about_ca_topic_score_gemma":0.008517401,"domain_scores_codex":[0.9986456,0.0004243233,0.00006977042,0.0003145785,0.0003110817,0.000234714],"domain_scores_gemma":[0.9980747,0.0009990002,0.0001629583,0.0003892288,0.0002695038,0.0001045696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005836113,0.0006550357,0.000830241,0.0003931663,0.0001415642,0.0001377384,0.0002657947,0.5490047,0.006565154,0.07543793,0.01136854,0.3546165],"study_design_scores_gemma":[0.00009334731,0.00008017963,0.0001340452,0.00001575314,0.00002654868,0.00005663064,0.00004363583,0.9378957,0.001737589,0.05716009,0.00273481,0.00002159323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01958455,0.0002957716,0.9725213,0.0003156834,0.0001275362,0.00009392527,0.00005315282,0.001112216,0.00589592],"genre_scores_gemma":[0.147031,0.0001934563,0.8449433,0.0002103006,0.00008381631,0.0001208042,0.0001835601,0.0003446858,0.006889129],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009872815,"threshold_uncertainty_score":0.03302789,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004772503037445953,"score_gpt":0.1974227877428128,"score_spread":0.1926502847053669,"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."}}