The following pages link to Bilevel programming: a survey (Q816429):
Displaying 50 items.
- Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints (Q336802) (← links)
- A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow (Q342561) (← links)
- Approximation algorithms for a bi-level knapsack problem (Q391212) (← links)
- Bilevel programming and the separation problem (Q403662) (← links)
- An objective penalty function of bilevel programming (Q430961) (← links)
- An improved particle swarm optimization for solving bilevel multiobjective programming problem (Q442987) (← links)
- Oops! I cannot do it again: testing for recursive feasibility in MPC (Q445103) (← links)
- A first order method for finding minimal norm-like solutions of convex optimization problems (Q463716) (← links)
- A quadratic objective penalty function for bilevel programming (Q488923) (← links)
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem (Q625647) (← links)
- Solving bi-level linear programming problem through hybrid of immune genetic algorithm and particle swarm optimization algorithm (Q669445) (← links)
- Efficiently solving linear bilevel programming problems using off-the-shelf optimization software (Q724343) (← links)
- On bilevel variational inequalities (Q743781) (← links)
- Bilevel optimization to deal with demand response in power grids: models, methods and challenges (Q828745) (← links)
- A dynamic programming algorithm for the bilevel Knapsack problem (Q833584) (← links)
- An inexact-restoration method for nonlinear bilevel programming problems (Q839690) (← links)
- Aggregation without loss of optimality in competitive location models (Q883193) (← links)
- Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice (Q971769) (← links)
- The computational complexity of bilevel assignment problems (Q976987) (← links)
- Application of particle swarm optimization algorithm for solving bi-level linear programming problem (Q980016) (← links)
- Multilevel decision-making: a survey (Q1615283) (← links)
- Interactive fuzzy decision making method for solving bilevel programming problem (Q1630782) (← links)
- Stochastic maximum flow interdiction problems under heterogeneous risk preferences (Q1652509) (← links)
- Observability of power systems with optimal PMU placement (Q1652693) (← links)
- Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems (Q1683936) (← links)
- An evolutionary algorithm using duality-base-enumerating scheme for interval linear bilevel programming problems (Q1719046) (← links)
- A differential evolution with two mutation strategies and a selection based on an improved constraint-handling technique for bilevel programming problems (Q1719209) (← links)
- Surveys in operations research (Q1730527) (← links)
- A note on linearized reformulations for a class of bilevel linear integer problems (Q1730617) (← links)
- Integrated passenger terminal capacity analysis under the capacity constraints of surrounding road network (Q1783104) (← links)
- Solving the fully fuzzy bilevel linear programming problem through deviation degree measures and a ranking function method (Q1793492) (← links)
- Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
- Solving bilevel multiobjective programming problem by elite quantum behaved particle swarm optimization (Q1938112) (← links)
- Separating tight metric inequalities by bilevel programming (Q1939716) (← links)
- A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project (Q1954798) (← links)
- An evolutionary algorithm for solving bilevel programming problems using duality conditions (Q1954813) (← links)
- An exact algorithm for bilevel 0-1 knapsack problems (Q1954852) (← links)
- Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm (Q1959233) (← links)
- Bi-level vendor-buyer strategies for a time-varying product price (Q2016278) (← links)
- Inequity-averse stochastic decision processes (Q2028863) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- The trouble with the second quantifier (Q2044549) (← links)
- Tri-level mixed-binary linear programming: solution approaches and application in defending critical infrastructure (Q2076898) (← links)
- Solving certain complementarity problems in power markets via convex programming (Q2085814) (← links)
- A note on the complexity of the bilevel bottleneck assignment problem (Q2095526) (← links)
- An efficient solution strategy for bilevel multiobjective optimization problems using multiobjective evolutionary algorithm (Q2100200) (← links)
- Portfolio problems with two levels decision-makers: optimal portfolio selection with pricing decisions on transaction costs (Q2178096) (← links)
- Bilevel programming approaches to production planning for multiple products with short life cycles (Q2190796) (← links)
- Parametrized inexact-ADMM based coordination games: a normalized Nash equilibrium approach (Q2242319) (← links)
- A solution method for semivectorial bilevel programming problem via penalty method (Q2251733) (← links)
