Pages that link to "Item:Q1266629"
From MaRDI portal
The following pages link to A simple tabu search method to solve the mixed-integer linear bilevel programming problem (Q1266629):
Displaying 31 items.
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing (Q264277) (← links)
- Solving discretely-constrained Nash-Cournot games with an application to power markets (Q300326) (← links)
- A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings (Q316165) (← links)
- Effect of solution representations on tabu search in scheduling applications (Q336636) (← links)
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions (Q336816) (← links)
- Enhanced exact algorithms for discrete bilevel linear problems (Q499703) (← links)
- Designing robust coverage networks to hedge against worst-case facility losses (Q617512) (← links)
- The budget constrained \(r\)-interdiction median problem with capacity expansion (Q623776) (← links)
- A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem -- a case study on supply chain model (Q639161) (← links)
- Solving bi-level linear programming problem through hybrid of immune genetic algorithm and particle swarm optimization algorithm (Q669445) (← links)
- Bilevel model for production-distribution planning solved by using ant colony optimization (Q709146) (← links)
- Application of particle swarm optimization algorithm for solving bi-level linear programming problem (Q980016) (← links)
- Solving zero-one mixed integer programming problems using tabu search (Q1609922) (← links)
- Multilevel decision-making: a survey (Q1615283) (← links)
- On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory (Q1683323) (← links)
- Feature selection for classification models via bilevel optimization (Q1734837) (← links)
- A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
- Fuzzy programming approach to multi-level programming problems (Q1810605) (← links)
- A hybrid tabu-ascent algorithm for the linear bilevel programming problem (Q1815061) (← links)
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913) (← links)
- Computation of the optimal tolls on the traffic network (Q2256224) (← links)
- A linearization approach to solve the natural gas cash-out bilevel problem (Q2430612) (← links)
- A new approach for solving linear bilevel problems using genetic algorithms (Q2469578) (← links)
- Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach (Q2569100) (← links)
- The leader multipurpose shopping location problem (Q2672066) (← links)
- An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems (Q2822279) (← links)
- A cooperative coevolution PSO technique for complex bilevel programming problems and application to watershed water trading decision making problems (Q4631082) (← links)
- Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study (Q4671306) (← links)
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem (Q4976158) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- Metaheuristics for bilevel optimization: a comprehensive review (Q6065604) (← links)
