A bilevel programming problem with maximization of a supermodular function in the lower level

DOI10.1007/s10878-012-9478-7zbMath1401.90186MaRDI QIDQ385481

Diana Fanghänel

Publication date: 2 December 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9478-7

zbMATH Keywords

combinatorial optimization; submodular function; bilevel programming; hierarchical optimization

Mathematics Subject Classification ID

91A65: Hierarchical games (including Stackelberg games)

90C27: Combinatorial optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality conditions for a bilevel matroid problem
• Parametric integer programming algorithm for bilevel mixed integer programs
• A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions
• Practical bilevel optimization. Algorithms and applications
• Foundations of bilevel programming
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Discrete linear bilevel programming problem
• Global optimization of mixed-integer bilevel programming problems
• Submodular functions and optimization.
• Graphic Submodular Function Minimization: A Graphic Approach and Applications
• Optimality criteria for bilevel programming problems using the radial subdifferential
• Bilevel programming with discrete lower level problems
• New Branch-and-Bound Rules for Linear Bilevel Programming
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints