{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001146408,0.0001915703,0.0001277113,0.00005607634,0.0005235586,0.0004084861,0.001039935,0.0000355646,0.00005597351],"category_scores_gemma":[0.00002973004,0.00008067008,0.00003244897,0.0004908479,0.001046032,0.0002223217,0.0002656836,0.0001762153,0.00005241494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009057255,"about_ca_system_score_gemma":0.00003319897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002901188,"about_ca_topic_score_gemma":3.667984e-7,"domain_scores_codex":[0.9982356,0.00005243523,0.0002089867,0.0003697264,0.0005742555,0.0005589706],"domain_scores_gemma":[0.9989377,0.0002902434,0.00003312782,0.0004777052,0.00008995363,0.000171248],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000127639,0.00003255198,0.00002694111,0.00001400367,0.00002590861,0.000006613707,0.002080337,0.04967047,0.005756429,0.1518155,0.0003866134,0.7901719],"study_design_scores_gemma":[0.0001812754,0.0001169772,0.00007320192,0.0001063432,0.00000952186,0.00002009543,0.00009116574,0.9882178,0.009097137,0.001704863,0.0001559417,0.0002256849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00600379,0.00005864875,0.9903935,0.002006194,0.0002949407,0.0002659343,0.000003452922,0.0002558458,0.0007177095],"genre_scores_gemma":[0.6889623,0.000006720108,0.3104542,0.0003660833,0.0001393221,0.00002361377,2.96718e-7,0.00002166688,0.00002573816],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9385473,"threshold_uncertainty_score":0.4026843,"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."}}