On Bilevel Programming and Its Impact in Branching, Cutting and Complexity

DOI10.1007/978-3-642-21311-3_3zbMath1302.90213OpenAlexW1868464093MaRDI QIDQ3003270

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

zbMATH Keywords

complexitybranchingbilevel programmingcutting

Mathematics Subject Classification ID

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

This page was built for publication: On Bilevel Programming and Its Impact in Branching, Cutting and Complexity