Optimality conditions for a bilevel matroid problem
From MaRDI portal
Publication:411248
DOI10.1007/S10878-010-9307-9zbMATH Open1263.90072OpenAlexW2041145484MaRDI QIDQ411248FDOQ411248
Authors: Diana Fanghänel 
Publication date: 4 April 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9307-9
Recommendations
- Optimality conditions for bilevel programming problems
- Optimality conditions for bilevel programming problems
- scientific article; zbMATH DE number 432976
- Optimality conditions for bilevel programming problems
- scientific article; zbMATH DE number 4139510
- Optimality conditions for the bilevel programming problem
- Optimality Conditions for a Simple Convex Bilevel Programming Problem
- Sufficient optimality conditions in bilevel programming
- A note on optimality conditions for bilevel programming problems∗
- Optimality conditions for the semivectorial bilevel optimization problem
Cites Work
- Foundations of 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.
- Title not available (Why is that?)
- Descent approaches for quadratic bilevel programming
- Discrete linear bilevel programming problem
- Bilevel programming with discrete lower level problems
- Optimality criteria for bilevel programming problems using the radial subdifferential
- Discrete bilevel programming: application to a natural gas cash-out problem
Cited In (3)
This page was built for publication: Optimality conditions for a bilevel matroid problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411248)
