A matheuristic for the discrete bilevel problem with multiple objectives at the lower level
From MaRDI portal
Publication:5364064
Recommendations
- Linear bilevel programs with multiple objectives at the upper level
- Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm
- A new exact method for linear bilevel problems with multiple objective functions at the lower level
- Bilevel programming with discrete lower level problems
- Multiobjective bilevel optimization
Cited in
(9)- Metaheuristics for bilevel optimization: a comprehensive review
- An efficient chemical reaction algorithm for multi-objective combinatorial bi-level optimization
- Coordinating harvest planning and scheduling in an agricultural supply chain through a stochastic bilevel programming
- A kernel search matheuristic to solve the discrete leader-follower location problem
- The Stackelberg model in territorial planning
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario
- Bilevel optimization: theory, algorithms, applications and a bibliography
- An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach
- A bilevel competitive location and pricing model with nonuniform split of demand
This page was built for publication: A matheuristic for the discrete bilevel problem with multiple objectives at the lower level
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5364064)
