Pages that link to "Item:Q4304827"

The following pages link to The Linear-Quadratic Bilevel Programming Problem (Q4304827):

Displaying 19 items.

• A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
• A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints (Q697548) (← links)
• On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
• A simple bilinear optimization problem (Q1095804) (← links)
• A computational analysis of LCP methods for bilinear and concave quadratic programming (Q1184453) (← links)
• Descent approaches for quadratic bilevel programming (Q1331096) (← links)
• Bilevel and multilevel programming: A bibliography review (Q1338535) (← links)
• A new descent algorithm for solving quadratic bilevel programming problems. (Q1582569) (← links)
• Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972) (← links)
• Feature selection for classification models via bilevel optimization (Q1734837) (← links)
• Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
• A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints (Q2329678) (← links)
• Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem (Q2389497) (← links)
• An overview of bilevel optimization (Q2480262) (← links)
• Branch and cut method for solving integer indefinite quadratic bilevel programs (Q2675637) (← links)
• A bi-level optimization model for the asset-liability management of insurance companies (Q2691300) (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
• Two-Level Linear Programming (Q5184666) (← links)
• Tight SDP relaxations for cardinality-constrained problems (Q6606656) (← links)