{"id":"W2613081544","doi":"","title":"New Branch-and-Cut Algorithm for Bilevel Linear Programming","year":2004,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Transpose; Branch and bound; Branch and cut; Linear programming; Algorithm; Integer programming; Bilevel optimization; Mathematics; Mathematical optimization; Branching (polymer chemistry); Set (abstract data type); Exploit; Criss-cross algorithm; Branch and price; Computer science; Linear-fractional programming; Optimization problem","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.001564864,0.00137737,0.001656088,0.001232596,0.000634986,0.001720689,0.001703347,0.001942516,0.005277257],"category_scores_gemma":[0.003666421,0.0008080736,0.0007294689,0.002032615,0.0007647531,0.002074225,0.002038216,0.003542465,0.001116473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001061633,"about_ca_system_score_gemma":0.001706103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002350197,"about_ca_topic_score_gemma":0.003351592,"domain_scores_codex":[0.9990751,0.0003050075,0.00004919052,0.0001282363,0.0003527172,0.0000897772],"domain_scores_gemma":[0.9988441,0.0006889036,0.00008564351,0.00008769639,0.0002333865,0.00006021109],"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.000171889,0.0001771965,0.0004086648,0.0002462265,0.0001101848,0.0001209659,0.0001252845,0.5066144,0.003464917,0.09219138,0.008080984,0.3882879],"study_design_scores_gemma":[0.00004760862,0.00003326655,0.00005102859,0.00002029777,0.0000125707,0.00003915943,0.00001291018,0.9667923,0.000832829,0.02831621,0.003831975,0.000009770075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001648507,0.0001615198,0.9961015,0.0001004102,0.00002931525,0.00003944824,0.00004049175,0.0003346721,0.001544157],"genre_scores_gemma":[0.03620271,0.0001937614,0.9612182,0.0001059346,0.0000435056,0.0002171582,0.0002422933,0.000194407,0.001582048],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005277257,"threshold_uncertainty_score":0.01765412,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0112541236968237,"score_gpt":0.2322524543107183,"score_spread":0.2209983306138946,"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."}}