Bilevel programming: a combinatorial perspective
From MaRDI portal
Recommendations
Cited in
(19)- Bilevel and multilevel programming: A bibliography review
- Bi-level strategies in semi-infinite programming.
- Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm
- A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent
- An overview of bilevel optimization
- Poisoning finite-horizon Markov decision processes at design time
- On bilevel machine scheduling problems
- scientific article; zbMATH DE number 1146101 (Why is no real title available?)
- Task assignment with controlled and autonomous agents
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Bilevel programming and price setting problems
- Bilevel Programming
- Counterfactual explanations for linear optimization
- On the complexity of the bilevel shortest path problem
- The robust bilevel selection problem
- On coupling constraints in linear bilevel optimization
- On coupling constraints in pessimistic linear bilevel optimization
- Complexity of bilevel linear programming with a single upper-level variable
- The bilevel knapsack problem with stochastic right-hand sides
This page was built for publication: Bilevel programming: a combinatorial perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717956)