Pages that link to "Item:Q336816"
From MaRDI portal
The following pages link to An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions (Q336816):
Displayed 49 items.
- Uncertain random multilevel programming with application to production control problem (Q521686) (← links)
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
- Multilevel decision-making: a survey (Q1615283) (← links)
- Solving discrete linear bilevel optimization problems using the optimal value reformulation (Q1675551) (← links)
- Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches (Q1683064) (← links)
- On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory (Q1683323) (← links)
- A single-level reformulation of mixed integer bilevel programming problems (Q1727937) (← 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)
- The impact of neighboring markets on renewable locations, transmission expansion, and generation investment (Q2030627) (← 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)
- The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling (Q2060426) (← links)
- Provable training set debugging for linear regression (Q2071505) (← links)
- Tri-level mixed-binary linear programming: solution approaches and application in defending critical infrastructure (Q2076898) (← links)
- The continuous maximum capacity path interdiction problem (Q2083925) (← links)
- On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints (Q2089868) (← links)
- A framework for generalized Benders' decomposition and its application to multilevel optimization (Q2097644) (← links)
- Robust optimization in power systems: a tutorial overview (Q2101660) (← links)
- Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy (Q2116889) (← links)
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (Q2164703) (← links)
- On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty (Q2189937) (← links)
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913) (← links)
- Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks (Q2242189) (← links)
- Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities (Q2245701) (← links)
- An exact algorithm for solving the bilevel facility interdiction and fortification problem (Q2294241) (← links)
- A survey of network interdiction models and algorithms (Q2294622) (← links)
- Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems (Q2423815) (← links)
- Intersection Cuts for Bilevel Optimization (Q3186493) (← links)
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem (Q4604908) (← links)
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem (Q4976158) (← links)
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method (Q4995065) (← links)
- A Unified Framework for Multistage Mixed Integer Linear Optimization (Q5014640) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- Core Pricing in Combinatorial Exchanges with Financially Constrained Buyers: Computational Hardness and Algorithmic Solutions (Q5031010) (← links)
- A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
- Managing Product Transitions: A Bilevel Programming Approach (Q5058022) (← links)
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets (Q5084616) (← links)
- Bilevel Integer Programs with Stochastic Right-Hand Sides (Q5084620) (← links)
- Benders Subproblem Decomposition for Bilevel Problems with Convex Follower (Q5087737) (← links)
- Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function (Q5129216) (← links)
- Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
- Solution techniques for bi-level knapsack problems (Q6047889) (← links)
- An exact solution algorithm for integer bilevel programming with application in energy market optimization (Q6103704) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- A bi-level multi-follower optimization model for R\&D project portfolio: an application to a pharmaceutical holding company (Q6115573) (← links)
- Presolving linear bilevel optimization problems (Q6169995) (← links)