A bilevel programming problem with maximization of a supermodular function in the lower level
From MaRDI portal
Publication:385481
DOI10.1007/S10878-012-9478-7zbMATH Open1401.90186OpenAlexW1964394986MaRDI QIDQ385481FDOQ385481
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Practical bilevel optimization. Algorithms and applications
- Foundations of bilevel programming
- Global optimization of mixed-integer bilevel programming problems
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Submodular functions and optimization.
- Discrete linear bilevel programming problem
- Bilevel programming with discrete lower level problems
- Parametric integer programming algorithm for bilevel mixed integer programs
- Graphic Submodular Function Minimization: A Graphic Approach and Applications
- Optimality criteria for bilevel programming problems using the radial subdifferential
- Optimality conditions for a bilevel matroid problem
- A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions
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)
