{"id":"W1973799058","doi":"10.1007/s10957-007-9263-4","title":"New Branch-and-Cut Algorithm for Bilevel Linear Programming","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Transpose; Branch and bound; Mathematics; Branch and cut; Bilevel optimization; Linear programming; Algorithm; Integer programming; Theory of computation; Mathematical optimization; Branching (polymer chemistry); Set (abstract data type); Optimization problem; Computer science","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.001118751,0.00007884268,0.0001287935,0.0001846067,0.0002025138,0.0001023496,0.0001780157,0.00004747673,0.00001623261],"category_scores_gemma":[0.00006310004,0.00006758897,0.00005936337,0.0004041691,0.00002650586,0.0004021467,0.00003281543,0.00006580708,8.87428e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001336576,"about_ca_system_score_gemma":0.00006716167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.343389e-7,"about_ca_topic_score_gemma":4.080606e-7,"domain_scores_codex":[0.9992313,0.00003230238,0.0003671394,0.0001358668,0.0001283118,0.0001050121],"domain_scores_gemma":[0.9987677,0.0003228558,0.0003108328,0.0001097341,0.0003483592,0.000140539],"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.00001177316,0.00004369403,0.00002249573,0.000005261488,0.00003978578,2.235061e-7,0.0001541752,0.0463891,0.00001916424,0.3246758,0.00005576589,0.6285828],"study_design_scores_gemma":[0.00117215,0.0001228268,0.0002416863,0.0000202312,0.0001126132,0.00009078818,0.0001077051,0.9009352,0.000534338,0.07092709,0.02550657,0.0002288325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001280645,0.0001929533,0.9986866,0.0007306581,0.00004127081,0.0002011217,0.00000256202,0.00002247166,0.00010963],"genre_scores_gemma":[0.00370747,0.0001296727,0.9952095,0.0002524135,0.0002515443,0.00001122217,0.0000075415,0.000006835374,0.0004237791],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8545461,"threshold_uncertainty_score":0.2756198,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01117445259928318,"score_gpt":0.2768035725164913,"score_spread":0.2656291199172081,"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."}}