{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002333087,0.0002795223,0.0002937708,0.0001943108,0.0001378932,0.0001480092,0.0001886439,0.0002129494,0.00001568301],"category_scores_gemma":[0.00009557142,0.0002826203,0.0001204131,0.000302516,0.00004024841,0.0002400959,0.00005728828,0.0002246154,0.00001104765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001797258,"about_ca_system_score_gemma":0.00008318063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004089563,"about_ca_topic_score_gemma":0.00018312,"domain_scores_codex":[0.9986022,0.00001076086,0.0003657604,0.000264553,0.0001691067,0.0005876966],"domain_scores_gemma":[0.9991543,0.00006664315,0.00005402324,0.0002988791,0.00005871943,0.000367416],"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.000007542727,0.00006951486,0.00005312091,0.0001294315,0.00004924247,0.000005713366,0.0002493352,0.02664653,0.0007407541,0.01726984,0.0004187416,0.9543602],"study_design_scores_gemma":[0.001619078,0.0001584025,0.0001401262,0.000125936,0.00006023399,0.00008358841,0.00006444656,0.9460492,0.01335243,0.01791306,0.0197784,0.0006550686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001036662,0.0007260118,0.9942698,0.0007558966,0.0001126837,0.001066827,0.00001554292,0.001833265,0.0001832476],"genre_scores_gemma":[0.03970604,0.000112274,0.9587358,0.0003331087,0.0001889017,0.0004401705,0.00002229241,0.0001089893,0.0003524375],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9537052,"threshold_uncertainty_score":0.9999626,"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."}}