On bilevel programming and its impact in branching, cutting and complexity. (Abstract)

DOI10.1007/978-3-642-21311-3_3zbMATH Open1302.90213OpenAlexW1868464093MaRDI QIDQ3003270FDOQ3003270

Authors: Andrea Lodi 

Publication date: 26 May 2011

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21311-3_3

Recommendations

• Bilevel programming and the separation problem
• New branch-and-Cut algorithm for bilevel linear programming
• Intersection cuts for bilevel optimization
• On the use of intersection cuts for bilevel optimization
• A new general-purpose algorithm for mixed-integer bilevel linear programs

zbMATH Keywords

complexitybilevel programmingbranchingcutting

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)

This page was built for publication: On bilevel programming and its impact in branching, cutting and complexity. (Abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003270)