{"id":"W2028182461","doi":"10.1007/s12597-009-0011-4","title":"Solving bilevel programming problems with multicriteria optimization techniques","year":2009,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Bilevel optimization; Mathematical optimization; Intersection (aeronautics); Relation (database); Class (philosophy); Multi-objective optimization; Computer science; Pareto principle; Pareto optimal; Optimization problem; Mathematics; Artificial intelligence; Data mining","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.000303201,0.00009552807,0.0001016486,0.0001877135,0.0001780537,0.0004098978,0.0003612462,0.0000396252,0.00004470155],"category_scores_gemma":[0.00003119533,0.00007561543,0.00002949891,0.0008302846,0.00002002036,0.0005943053,0.00005861907,0.0000852823,0.000009294012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003708431,"about_ca_system_score_gemma":0.00006887697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002026144,"about_ca_topic_score_gemma":0.000002680067,"domain_scores_codex":[0.9989468,0.00004833745,0.0001612149,0.0002881035,0.000330175,0.0002253965],"domain_scores_gemma":[0.9992979,0.00002793001,0.00005584818,0.0002511495,0.000294883,0.00007232311],"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.00002120812,0.0005310137,0.001323441,0.00003813714,0.00005814437,0.00001462698,0.001831854,0.3441251,0.002999173,0.0524401,0.0002618447,0.5963554],"study_design_scores_gemma":[0.0001570024,0.0001435845,0.0007147472,0.0000309206,0.000005297062,0.000007236471,0.00001095217,0.9966426,0.0009570934,0.0003465984,0.0008412891,0.0001426013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001267475,0.00001430195,0.9957051,0.002220693,0.00001510347,0.0002454625,6.331971e-7,0.0002559566,0.001416003],"genre_scores_gemma":[0.1568087,0.00001224101,0.8425876,0.0001892749,0.00003063105,0.00002567925,0.00001303974,0.000005825792,0.0003269142],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6525176,"threshold_uncertainty_score":0.3952654,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01944054381970481,"score_gpt":0.2741314883152999,"score_spread":0.254690944495595,"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."}}