{"id":"W2120279149","doi":"10.1007/s11590-008-0085-6","title":"On a posterior evaluation of a simple greedy method for set packing","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Simple (philosophy); Set packing; Mathematics; Mathematical optimization; Set (abstract data type); Upper and lower bounds; Greedy algorithm; Relaxation (psychology); Packing problems; Function (biology); Linear programming relaxation; Combinatorics; Computer science; Linear programming","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.007143022,0.001659963,0.002363025,0.001551538,0.001127427,0.002794575,0.002667218,0.002750943,0.01331558],"category_scores_gemma":[0.02926182,0.001099964,0.001310403,0.001759729,0.002252026,0.004111235,0.00386298,0.003101827,0.001678334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002122851,"about_ca_system_score_gemma":0.003129181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005488798,"about_ca_topic_score_gemma":0.007758,"domain_scores_codex":[0.9953073,0.002304514,0.0001627065,0.0003906713,0.001502016,0.0003328894],"domain_scores_gemma":[0.9841728,0.01226973,0.0003470292,0.001158303,0.001611278,0.0004407652],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001398747,0.000255142,0.001530207,0.0004523439,0.0001718553,0.0001463657,0.0001982304,0.536321,0.005994132,0.1571186,0.01494552,0.2814677],"study_design_scores_gemma":[0.00004053775,0.00005131552,0.0001672049,0.00002653573,0.00001737702,0.00004349601,0.00001413504,0.9705574,0.0008141797,0.02739308,0.0008601687,0.00001469986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01191701,0.0003949759,0.9812527,0.0004762116,0.0001422079,0.000102209,0.00008696036,0.0005490291,0.005078699],"genre_scores_gemma":[0.2245509,0.0004728496,0.7626917,0.0004626407,0.000400724,0.0003753444,0.0004758216,0.0008873001,0.00968255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01331558,"threshold_uncertainty_score":0.04454505,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04883040661566376,"score_gpt":0.2983069939448683,"score_spread":0.2494765873292046,"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."}}