{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001808876,0.00008719804,0.0001213626,0.00004499537,0.0001513153,0.00004076567,0.00007962403,0.00005470838,0.0001619183],"category_scores_gemma":[0.00008562434,0.00008370205,0.00005520186,0.0001926721,0.00003492365,0.00009503938,0.00001777113,0.0001193218,0.00006218383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003344166,"about_ca_system_score_gemma":0.00001881455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002595976,"about_ca_topic_score_gemma":1.971123e-7,"domain_scores_codex":[0.9992566,0.00001277448,0.0001625184,0.0001205927,0.0001819917,0.0002655057],"domain_scores_gemma":[0.9996015,0.00007592628,0.0000137887,0.0001041935,0.0001153369,0.00008925033],"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":[0.00007297783,0.0002923282,0.001374557,0.001427886,0.0002476149,0.00003653441,0.001134257,0.03950836,0.003799919,0.0272735,0.009779994,0.9150521],"study_design_scores_gemma":[0.0007774543,0.00007197916,0.0001401559,0.00004987741,0.00001582899,0.0000465055,0.00004969117,0.9136517,0.0008605419,0.001011637,0.08303124,0.0002933705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03005793,0.0005678822,0.9550681,0.0003853579,0.0004848932,0.001164382,0.000006650607,0.001035511,0.0112293],"genre_scores_gemma":[0.2911163,0.0002436402,0.7040289,0.00007470795,0.0007668411,0.0002280437,0.0001542269,0.00009945797,0.003287867],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9147587,"threshold_uncertainty_score":0.341327,"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."}}