The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 817607
- An algorithm for the mixed-integer nonlinear bilevel programming problem
- scientific article; zbMATH DE number 1264394
- An algorithm for the integer linear fractional bilevel programming problem
- An enhanced branch-and-bound algorithm for bilevel integer linear programming
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A simple algorithm for the-linear bilevel programming problem
- The Mixed Integer Linear Bilevel Programming Problem
- scientific article; zbMATH DE number 35514
- An integer linear programming approach for bilinear integer programming
Cites work
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A bilevel mixed-integer program for critical infrastructure protection planning
- A leader-follower game in competitive facility location
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- A modified simplex approach for solving bilevel linear programming problems
- A sequential LCP method for bilevel linear programming
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- Algorithms for solving the mixed integer two-level linear programming problem
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Bilevel knapsack with interdiction constraints
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL INTEGER PROGRAMMING PROBLEMS
- Discrete bilevel programming: application to a natural gas cash-out problem
- Disjunctive cuts for continuous linear bilevel programming
- Enhanced exact algorithms for discrete bilevel linear problems
- Global optimization of mixed-integer bilevel programming problems
- Global solution of nonlinear mixed-integer bilevel programs
- Intersection cuts for bilevel optimization
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On generalized semi-infinite optimization and bilevel optimization
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- On two-level optimization
- Optimizing system resilience: a facility protection model with recovery time
- Parametric global optimisation for bilevel programming
- Parametric integer programming algorithm for bilevel mixed integer programs
- Production planning problem with sequence dependent setups as a bilevel programming problem
- Sequential discrete p-facility models for competitive location planning
- The Mixed Integer Linear Bilevel Programming Problem
Cited in
(22)- 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
- Feature selection for classification models via bilevel optimization
- Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy
- 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
- An enhanced branch-and-bound algorithm for bilevel integer linear programming
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- Existence of solutions in bilevel stochastic linear programming with integer variables in the lower level problem
- Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds
- A unified framework for multistage mixed integer linear optimization
- 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
- A Gilmore-Gomory construction of integer programming value functions
- A survey on mixed-integer programming techniques in bilevel optimization
- Branch-and-cut solution approach for multilevel mixed integer linear programming problems
- Mixed-integer bilevel representability
- Bilevel Integer Programs with Stochastic Right-Hand Sides
- Managing Product Transitions: A Bilevel Programming Approach
- Bilevel optimization: theory, algorithms, applications and a bibliography
- 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: The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976158)
