{"id":"W7105897877","doi":"10.23952/jano.7.2025.3.08","title":"A line decomposition algorithm for multiobjective optimization","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Multi-objective optimization; Line (geometry); Decomposition; Minification; Optimization algorithm; Genetic algorithm","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001061943,0.001556571,0.001081323,0.0008507886,0.0005985555,0.00121924,0.001165932,0.001462279,0.009508123],"category_scores_gemma":[0.002386721,0.0005996078,0.00124371,0.001049769,0.0006033985,0.0008773629,0.001385777,0.002415132,0.004059183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007388463,"about_ca_system_score_gemma":0.001351658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002788443,"about_ca_topic_score_gemma":0.002630226,"domain_scores_codex":[0.9992355,0.0002459205,0.00004999568,0.0001127495,0.0002981004,0.00005766938],"domain_scores_gemma":[0.9991585,0.0003542814,0.00006398102,0.00009333647,0.0002869351,0.00004299442],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000641472,0.00008678536,0.0003801181,0.0002514058,0.00008266047,0.0001016562,0.0000940949,0.6925842,0.006116786,0.03574608,0.01170947,0.2527827],"study_design_scores_gemma":[0.00001885818,0.00002399348,0.00005236565,0.00002430445,0.000006245102,0.00003711497,0.00001051306,0.9808511,0.00125039,0.009918328,0.007796844,0.000009953572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003764421,0.00006072612,0.9982681,0.00003144762,0.00001913953,0.00002659567,0.00003673831,0.0003166833,0.0008640925],"genre_scores_gemma":[0.01725223,0.0001134796,0.9800576,0.00006581087,0.00001821,0.0002759418,0.0002251821,0.0002690103,0.001722575],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009508123,"threshold_uncertainty_score":0.0318079,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00808009215581886,"score_gpt":0.2874106348575149,"score_spread":0.2793305427016961,"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."}}