A new general-purpose algorithm for mixed-integer bilevel linear programs
From MaRDI portal
Recommendations
- Intersection cuts for bilevel optimization
- An exact solution algorithm for integer bilevel programming with application in energy market optimization
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- On the use of intersection cuts for bilevel optimization
- New branch-and-Cut algorithm for bilevel linear programming
Cited in
(93)- An algorithm for the mixed-integer nonlinear bilevel programming problem
- Exact algorithms for the minimum cost vertex blocker clique problem
- A single-level reformulation of mixed integer bilevel programming problems
- The maximum clique interdiction problem
- A dynamic reformulation heuristic for generalized interdiction problems
- A hybrid tabu-ascent algorithm for the linear bilevel programming problem
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem
- The impact of neighboring markets on renewable locations, transmission expansion, and generation investment
- An enhanced branch-and-bound algorithm for bilevel integer linear programming
- A branch-and-cut algorithm for the edge interdiction clique problem
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
- The trouble with the second quantifier
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems
- The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling
- The continuous maximum capacity path interdiction problem
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
- On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints
- A framework for generalized Benders' decomposition and its application to multilevel optimization
- Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy
- On a generalization of the Chvátal-Gomory closure
- The probabilistic travelling salesman problem with crowdsourcing
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- Mixed-integer bilevel representability
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- Complexity of near-optimal robust versions of multilevel optimization problems
- Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks
- Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities
- A branch-and-cut algorithm for mixed-integer bilinear programming
- An exact algorithm for solving the bilevel facility interdiction and fortification problem
- Resilient layout, design and operation of energy-efficient water distribution networks for high-rise buildings using MINLP
- New branch-and-Cut algorithm for bilevel linear programming
- A smoothing heuristic for a bilevel pricing problem
- A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences
- Multi-stage optimal design of road networks for automated vehicles with elastic multi-class demand
- The leader multipurpose shopping location problem
- On bilevel programming and its impact in branching, cutting and complexity. (Abstract)
- Intersection cuts for bilevel optimization
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Bilevel programming and the separation problem
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
- Multilevel approaches for the critical node problem
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
- A unified framework for multistage mixed integer linear optimization
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Core pricing in combinatorial exchanges with financially constrained buyers: computational hardness and algorithmic solutions
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- A Catalog of Formulations for the Network Pricing Problem
- Managing Product Transitions: A Bilevel Programming Approach
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- Bilevel Integer Programs with Stochastic Right-Hand Sides
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Benders Subproblem Decomposition for Bilevel Problems with Convex Follower
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
- A generic optimization framework for resilient systems
- Solution techniques for bi-level knapsack problems
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
- Metaheuristics for bilevel optimization: a comprehensive review
- Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem
- A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
- Why there is no need to use a big-M in linear bilevel optimization: a computational study of two ready-to-use approaches
- A survey on bilevel optimization under uncertainty
- An exact solution algorithm for integer bilevel programming with application in energy market optimization
- Interdicting restructuring networks with applications in illicit trafficking
- A survey on mixed-integer programming techniques in bilevel optimization
- On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level
- An exact method for binary fortification games
- Mathematical programming formulations for the collapsed k-core problem
- Presolving linear bilevel optimization problems
- Branch-and-cut solution approach for multilevel mixed integer linear programming problems
- Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- Computational linear bilevel optimization
- A penalty branch-and-bound method for mixed-integer quadratic bilevel problems. I: Key ideas and a fixed parameter setting
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- Learning primal heuristics for 0-1 knapsack interdiction problems
- Solution methods for partial inverse combinatorial optimization problems in which weights can only be increased
- Perspectives on optimizing transport systems with supply-dependent demand
- Edge downgrades in the maximal covering location problem
- Deep learning based high accuracy heuristic approach for knapsack interdiction problem
- The Maximal covering location disruption problem
- Integer linear programming formulations for the maximum flow blocker problem
- How many clues to give? A bilevel formulation for the minimum Sudoku clue problem
- Markov decision process design: a framework for integrating strategic and operational decisions
- A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
- Existence of solutions in bilevel stochastic linear programming with integer variables in the lower level problem
- Minimum cost edge blocker clique problem
This page was built for publication: A new general-purpose algorithm for mixed-integer bilevel linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4602475)
