An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
From MaRDI portal
(Redirected from Publication:336816)
Recommendations
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- Enhanced exact algorithms for discrete bilevel linear problems
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
- An enhanced branch-and-bound algorithm for bilevel integer linear programming
- A new general-purpose algorithm for mixed-integer bilevel linear programs
Cites work
- scientific article; zbMATH DE number 4191395 (Why is no real title available?)
- scientific article; zbMATH DE number 35514 (Why is no real title available?)
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- A solution method for the static constrained Stackelberg problem via penalty method
- An algorithm for the mixed-integer nonlinear bilevel programming problem
- An overview of bilevel optimization
- Bilevel and multilevel programming: A bibliography review
- Bilevel linear programming
- COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL INTEGER PROGRAMMING PROBLEMS
- Computational Difficulties of Bilevel Linear Programming
- Convex two-level optimization
- Defense Applications of Mathematical Programs with Optimization Problems in the Constraints
- Discrete linear bilevel programming problem
- Exponential distribution-based genetic algorithm for solving mixed-integer bilevel programming problems
- Global optimization of mixed-integer bilevel programming problems
- Global solution of nonlinear mixed-integer bilevel programs
- Mathematical Programs with Optimization Problems in the Constraints
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Optimizing Frequencies in a Transit Network: a Nonlinear Bi‐level Programming Approach
- Parametric global optimisation for bilevel programming
- Parametric integer programming algorithm for bilevel mixed integer programs
- Parametric integer programming in fixed dimension
- Production and marketing decisions with multiple objectives in a competitive environment
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- The Mixed Integer Linear Bilevel Programming Problem
- Two-Level Linear Programming
Cited in
(57)- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- A framework for generalized Benders' decomposition and its application to multilevel optimization
- Core pricing in combinatorial exchanges with financially constrained buyers: computational hardness and algorithmic solutions
- Learning and forgetting interactions within a collaborative human-centric manufacturing network
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
- A single-level reformulation of mixed integer bilevel programming problems
- Robust optimization in power systems: a tutorial overview
- Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches
- The continuous maximum capacity path interdiction problem
- Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- Intersection cuts for bilevel optimization
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks
- On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty
- A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem
- An enhanced branch-and-bound algorithm for bilevel integer linear programming
- The impact of neighboring markets on renewable locations, transmission expansion, and generation investment
- Benders Subproblem Decomposition for Bilevel Problems with Convex Follower
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
- A bi-level multi-follower optimization model for R\&D project portfolio: an application to a pharmaceutical holding company
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
- A survey of network interdiction models and algorithms
- A decentralized production–distribution scheduling problem: Solution and analysis
- A unified framework for multistage mixed integer linear optimization
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems
- An algorithm for the mixed-integer nonlinear bilevel programming problem
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities
- Solving discrete linear bilevel optimization problems using the optimal value reformulation
- Why there is no need to use a big-\(M\) in linear bilevel optimization: a computational study of two ready-to-use approaches
- On the use of intersection cuts for bilevel optimization
- The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling
- A survey on mixed-integer programming techniques in bilevel optimization
- On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- An exact algorithm for solving the bilevel facility interdiction and fortification problem
- Presolving linear bilevel optimization problems
- Bilevel Integer Programs with Stochastic Right-Hand Sides
- Enhanced exact algorithms for discrete bilevel linear problems
- Provable training set debugging for linear regression
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- Managing Product Transitions: A Bilevel Programming Approach
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- Multilevel decision-making: a survey
- Uncertain random multilevel programming with application to production control problem
- Tri-level mixed-binary linear programming: solution approaches and application in defending critical infrastructure
- Bilevel optimization: theory, algorithms, applications and a bibliography
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints
- Solution techniques for bi-level knapsack problems
- An exact solution algorithm for integer bilevel programming with application in energy market optimization
This page was built for publication: An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336816)
