Pages that link to "Item:Q2463829"

The following pages link to Disjunctive cuts for continuous linear bilevel programming (Q2463829):

Displaying 22 items.

• A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
• Enhanced exact algorithms for discrete bilevel linear problems (Q499703) (← links)
• Multilevel decision-making: a survey (Q1615283) (← links)
• A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
• On a class of bilevel linear mixed-integer programs in adversarial settings (Q1754450) (← links)
• On the use of intersection cuts for bilevel optimization (Q1800991) (← links)
• Closing the gap in linear bilevel optimization: a new valid primal-dual inequality (Q2039060) (← links)
• SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (Q2164703) (← links)
• Mixed-integer bilevel representability (Q2220657) (← links)
• A cutting plane method for bilevel linear programming with interval coefficients (Q2259044) (← links)
• Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
• A solution to bi/tri-level programming problems using particle swarm optimization (Q2282140) (← links)
• Intersection Cuts for Bilevel Optimization (Q3186493) (← links)
• Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970) (← links)
• The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem (Q4976158) (← links)
• Algorithms for Linear Bilevel Optimization (Q5014632) (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
• On Bilevel Optimization with Inexact Follower (Q5120277) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
• On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs (Q6589745) (← links)
• Robust bilevel optimization for near-optimal lower-level solutions (Q6635807) (← links)
• A tutorial on solving single-leader-multi-follower problems using SOS1 reformulations (Q6659808) (← links)