Pages that link to "Item:Q3186493"
From MaRDI portal
The following pages link to Intersection Cuts for Bilevel Optimization (Q3186493):
Displaying 33 items.
- Bilevel programming and the separation problem (Q403662) (← links)
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
- Optimizing power generation in the presence of micro-grids (Q724120) (← links)
- Integer programming formulations for three sequential discrete competitive location problems with foresight (Q1681140) (← links)
- A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
- On the use of intersection cuts for bilevel optimization (Q1800991) (← links)
- A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem (Q2029945) (← links)
- An enhanced branch-and-bound algorithm for bilevel integer linear programming (Q2030724) (← links)
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality (Q2039060) (← links)
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems (Q2044965) (← links)
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities (Q2089867) (← links)
- Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy (Q2116889) (← links)
- Maximal quadratic-free sets (Q2118125) (← links)
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (Q2164703) (← links)
- Partial hyperplane activation for generalized intersection cuts (Q2175444) (← links)
- A cutting plane method for bilevel linear programming with interval coefficients (Q2259044) (← links)
- A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
- Algorithms and applications for a class of bilevel MILPs (Q2283108) (← links)
- Disjunctive cuts for continuous linear bilevel programming (Q2463829) (← links)
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs (Q4602475) (← links)
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem (Q4976158) (← links)
- Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method (Q4995065) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- Maximal Quadratic-Free Sets (Q5041754) (← links)
- Intersection Disjunctions for Reverse Convex Sets (Q5076701) (← links)
- Benders Subproblem Decomposition for Bilevel Problems with Convex Follower (Q5087737) (← links)
- Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
- Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization (Q5144791) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5918425) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)
- Bilevel optimization for joint scheduling of production and energy systems (Q6159497) (← links)