{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002290973,0.001741847,0.001565109,0.001981143,0.0006986424,0.003114387,0.002896252,0.001482538,0.005479633],"category_scores_gemma":[0.007463758,0.0009144738,0.001706965,0.002410975,0.001992721,0.005542716,0.002822292,0.00556162,0.0008338836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001828611,"about_ca_system_score_gemma":0.001064921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001104784,"about_ca_topic_score_gemma":0.001779336,"domain_scores_codex":[0.9983503,0.0006506655,0.00007369098,0.0002123656,0.0006438789,0.00006917077],"domain_scores_gemma":[0.9963708,0.00253031,0.0002651435,0.0002933413,0.0004055552,0.0001349298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002442565,0.00007737062,0.0002425929,0.0003061098,0.00009430575,0.00004167448,0.0001031616,0.1662533,0.0006542691,0.7741138,0.00483876,0.05325031],"study_design_scores_gemma":[0.00001372807,0.00001398364,0.00008585924,0.00003649383,0.00002135156,0.00002973547,0.00002399048,0.4321668,0.0001987522,0.5588407,0.008554425,0.0000142622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001630868,0.00193111,0.9891129,0.0008395584,0.0002351777,0.00002093547,0.0000381262,0.00005034545,0.006141104],"genre_scores_gemma":[0.1178921,0.007280678,0.8563565,0.0009727235,0.00215114,0.0003605907,0.0002107897,0.0002745907,0.01450083],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005479633,"threshold_uncertainty_score":0.01833123,"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."}}