The robust bilevel selection problem

DOI10.5802/OJMO.40MaRDI QIDQ6961165zbMATH OpenFDO

Authors Dorothee Henke

Publication date 11 July 2025

Published in OJMO. Open Journal of Mathematical Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

computational complexitycombinatorial optimizationbilevel optimizationrobust optimizationselection problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Hierarchical games (including Stackelberg games) (91A65) Robustness in mathematical programming (90C17)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 6157240 (Why is no real title available?)
• scientific article; zbMATH DE number 2246593 (Why is no real title available?)
• A note on the complexity of the bilevel bottleneck assignment problem
• A randomized algorithm for the min-Max selecting items problem with uncertain weights
• A robust approach for modeling limited observability in bilevel optimization
• A study on the computational complexity of the bilevel knapsack problem
• A survey on bilevel optimization under uncertainty
• An exact algorithm for bilevel 0-1 knapsack problems
• An overview of bilevel optimization
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Bilevel programming problems. Theory, algorithms and applications to energy networks
• Bilevel programming with knapsack constraints
• Combinatorial optimization. Theory and algorithms
• Discrete linear bilevel programming problem
• Discrete-variable extremum problems
• Finding the upper envelope of n line segments in O(n log n) time
• On bilevel minimum and bottleneck spanning tree problems
• On the approximability of average completion time scheduling under precedence constraints.
• On the complexity of robust bilevel optimization with uncertain follower's objective
• On the complexity of the bilevel minimum spanning tree problem
• Parameterized algorithms
• Robust combinatorial optimization under convex and discrete cost uncertainty
• Robust discrete optimization and its applications
• Robust optimization
• The computational complexity of bilevel assignment problems
• The polynomial hierarchy and a simple model for competitive analysis
• The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
• The stochastic bilevel continuous knapsack problem with uncertain follower's objective
• The trouble with the second quantifier
• Time bounds for selection

This page was built for publication: The robust bilevel selection problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6961165)