Optimality conditions for a bilevel matroid problem

DOI10.1007/S10878-010-9307-9zbMath1263.90072OpenAlexW2041145484MaRDI QIDQ411248

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

zbMATH Keywords

matroidsbilevel programming

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (3)

A bilevel programming problem with maximization of a supermodular function in the lower level ⋮ Optimality conditions for mixed discrete bilevel optimization problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• Descent approaches for quadratic bilevel programming
• Foundations of bilevel programming
• Discrete bilevel programming: application to a natural gas cash-out problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Discrete linear bilevel programming problem
• Submodular functions and optimization.
• Optimality criteria for bilevel programming problems using the radial subdifferential
• Bilevel programming with discrete lower level problems
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints

This page was built for publication: Optimality conditions for a bilevel matroid problem