Scatter search with path relinking for linear bilevel problems
From MaRDI portal
Cites work
- A facility location problem for extracurricular workshop planning: bi-level model and metaheuristics
- A heuristic algorithm for a supply chain's production-distribution planning
- A new approach for solving linear bilevel problems using genetic algorithms
- A note on the definition of a linear bilevel programming solution
- Algorithms for Linear Bilevel Optimization
- BilevelJuMP.jl: modeling and solving bilevel optimization problems in Julia
- Characterizing an optimal solution to the linear bilevel programming problem
- Foundations of bilevel programming
- Fundamentals of scatter search and path relinking
- Linear bilevel programming solution by genetic algorithm
- Linear bilevel programming with upper level constraints depending on the lower level solution
- Metaheuristics for bilevel optimization: a comprehensive review
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On coupling constraints in linear bilevel optimization
- On two-level optimization
- Practical bilevel optimization. Algorithms and applications
- Principles of scatter search
- SSPMO: a scatter tabu search procedure for non-linear multiobjective optimization
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
- Two-Level Linear Programming
This page was built for publication: Scatter search with path relinking for linear bilevel problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6921928)
