Pages that link to "Item:Q596661"
From MaRDI portal
The following pages link to A computational study of global algorithms for linear bilevel programming (Q596661):
Displaying 16 items.
- A simplex approach for finding local solutions of a linear bilevel program by equilibrium points (Q817135) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- An extended branch and bound algorithm for linear bilevel programming (Q849816) (← links)
- Solving bilevel linear programs using multiple objective linear programming (Q1016404) (← links)
- A note on a linear bilevel programming algorithm based on bicriteria programming (Q1112732) (← links)
- Linear bilevel problems: genericity results and an efficient method for computing local minima (Q1397066) (← links)
- Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function (Q1699146) (← links)
- A differential evolution with two mutation strategies and a selection based on an improved constraint-handling technique for bilevel programming problems (Q1719209) (← links)
- A study of local solutions in linear bilevel programming (Q1781863) (← links)
- Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
- An enhanced branch-and-bound algorithm for bilevel integer linear programming (Q2030724) (← links)
- Theoretical and computational results for a linear bilevel problem (Q2768048) (← links)
- An algorithm for the discrete bilevel programming problem (Q3989989) (← links)
- On a Solving Bilevel D.C.-Convex Optimization Problems (Q4965111) (← links)
- Global Search for Bilevel Optimization with Quadratic Data (Q5014633) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
