{"id":"W2774074136","doi":"10.1007/bf03398807","title":"Revisiting Dinkelbach-type algorithms for generalized fractional programs","year":2008,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Iterated function; Computer science; Type (biology); Mathematical optimization; Algorithm; Fractional programming; Applied mathematics; Mathematics; Nonlinear programming; Nonlinear system","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.003515108,0.001200679,0.001471625,0.001483934,0.001121546,0.002508241,0.001975863,0.001839309,0.008431064],"category_scores_gemma":[0.0139126,0.0005368384,0.001261653,0.002080315,0.001727303,0.003703173,0.002917182,0.002837142,0.001360819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001705393,"about_ca_system_score_gemma":0.001778081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002911392,"about_ca_topic_score_gemma":0.00494731,"domain_scores_codex":[0.9985465,0.0006700405,0.00008795516,0.0001884962,0.0003840863,0.0001227534],"domain_scores_gemma":[0.9972188,0.001805784,0.00008575927,0.0003902337,0.0004138162,0.00008564207],"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.0001548822,0.0001039379,0.0006631407,0.0002451121,0.00006024406,0.00005254625,0.000196287,0.1816443,0.001515834,0.609738,0.004399193,0.2012264],"study_design_scores_gemma":[0.00003420929,0.00005233251,0.0001308149,0.0001080825,0.0000181839,0.00004780974,0.00004868784,0.7000614,0.00139669,0.2886872,0.009394516,0.00001998496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008386067,0.0006075221,0.9769163,0.0004471916,0.0002737557,0.00005578698,0.00004619829,0.0001966277,0.01307056],"genre_scores_gemma":[0.1839115,0.0009755822,0.799596,0.0006525706,0.0002275034,0.0002061132,0.0001427533,0.0004069428,0.01388097],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008431064,"threshold_uncertainty_score":0.02820474,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09134289677039446,"score_gpt":0.3276415467877081,"score_spread":0.2362986500173136,"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."}}