{"id":"W2083246371","doi":"10.1007/s10107-013-0703-7","title":"New approaches to multi-objective optimization","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Matroid; Mathematics; Mathematical optimization; Matching (statistics); Spanning tree; Bipartite graph; Approximation algorithm; Rounding; Combinatorics; Computer science; Graph","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":[],"consensus_categories":[],"category_scores_codex":[0.0001815285,0.0001411834,0.0001690726,0.00009690101,0.000126202,0.0004740547,0.0005880952,0.00005048281,0.0001198565],"category_scores_gemma":[0.000111527,0.0001205149,0.00007050097,0.0005239461,0.00003125459,0.0004388316,0.0003193713,0.0001156022,0.0004457767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002776543,"about_ca_system_score_gemma":0.00002505289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002905111,"about_ca_topic_score_gemma":0.000001650806,"domain_scores_codex":[0.9988368,0.00003393738,0.0002243918,0.0003399907,0.0002308841,0.000333992],"domain_scores_gemma":[0.999185,0.0001041407,0.00004386644,0.0003868657,0.00003409522,0.0002460339],"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":[8.256861e-7,0.000184162,0.0000167615,0.00003468061,0.00001644966,0.000001825938,0.002600784,0.002400974,0.000008788343,0.3470771,0.0001996316,0.647458],"study_design_scores_gemma":[0.0001725707,0.00006731327,0.00006936483,0.00003565731,0.000004470322,0.00001047936,0.0001306835,0.8930049,0.0001879271,0.105657,0.000453249,0.0002064075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002006663,0.00001797225,0.9956871,0.001567013,0.00007340178,0.0006999707,1.587347e-7,0.0003254557,0.001428213],"genre_scores_gemma":[0.02076829,2.650541e-7,0.9785606,0.0001098955,0.00005132093,0.0001295791,9.28056e-7,0.00001080305,0.0003683681],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.890604,"threshold_uncertainty_score":0.5729707,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1149013214391176,"score_gpt":0.2635967916886539,"score_spread":0.1486954702495363,"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."}}