{"id":"W3202113264","doi":"10.29007/8d9g","title":"Improved Algorithm for the Incremental Assignment Problem","year":2021,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Nipissing University; Laurentian University","funders":"","keywords":"Bipartite graph; Assignment problem; Hungarian algorithm; 3-dimensional matching; Matching (statistics); Algorithm; Blossom algorithm; Generalized assignment problem; Mathematics; Weapon target assignment problem; Graph; Quadratic assignment problem; Mathematical optimization; Computer science; Optimization problem; Combinatorics","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.00104942,0.001142002,0.001157705,0.001474475,0.001136378,0.001268599,0.003196075,0.001358845,0.0129924],"category_scores_gemma":[0.003765587,0.0004434868,0.001105995,0.00203925,0.0007117141,0.002617294,0.002382722,0.002346518,0.003374492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008763336,"about_ca_system_score_gemma":0.002289501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003275354,"about_ca_topic_score_gemma":0.003026294,"domain_scores_codex":[0.9986009,0.000330968,0.00009293294,0.0003101661,0.0004354165,0.0002296014],"domain_scores_gemma":[0.9988132,0.000366237,0.00007542205,0.0002313766,0.0004482418,0.00006555324],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003179425,0.0002573916,0.0007707211,0.0003380947,0.00007672943,0.0002423058,0.0002253246,0.2167791,0.005634298,0.1276084,0.03358217,0.6141676],"study_design_scores_gemma":[0.0001285605,0.0001275073,0.00025196,0.00003594528,0.00004838609,0.0003344132,0.0000669036,0.8974379,0.003186875,0.06638978,0.03195076,0.00004094797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003684583,0.0001944793,0.9894035,0.0001780052,0.000118046,0.0001264517,0.0001017316,0.0007340924,0.005459045],"genre_scores_gemma":[0.07752409,0.0003073592,0.9129355,0.0002133878,0.0001324744,0.0004693322,0.0007477546,0.0002800664,0.00739005],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0129924,"threshold_uncertainty_score":0.04346395,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01369102880265367,"score_gpt":0.2479045922986634,"score_spread":0.2342135634960097,"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."}}