A bilevel programming problem with maximization of a supermodular function in the lower level
From MaRDI portal
(Redirected from Publication:385481)
Recommendations
Cites work
- A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Bilevel programming with discrete lower level problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Discrete linear bilevel programming problem
- Foundations of bilevel programming
- Global optimization of mixed-integer bilevel programming problems
- Graphic submodular function minimization: a graphic approach and applications
- scientific article; zbMATH DE number 1102774 (Why is no real title available?)
- scientific article; zbMATH DE number 894716 (Why is no real title available?)
- Inverse combinatorial optimization: a survey on problems, methods, and results
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Optimality conditions for a bilevel matroid problem
- Optimality criteria for bilevel programming problems using the radial subdifferential
- Parametric integer programming algorithm for bilevel mixed integer programs
- Practical bilevel optimization. Algorithms and applications
- Submodular function minimization
- Submodular functions and optimization.
This page was built for publication: A bilevel programming problem with maximization of a supermodular function in the lower level
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385481)
