A value-function-based exact approach for the bilevel mixed-integer programming problem
From MaRDI portal
Publication:4604908
DOI10.1287/OPRE.2017.1589zbMATH Open1387.90161OpenAlexW2605397371MaRDI QIDQ4604908FDOQ4604908
Authors: Leonardo Lozano, J. Cole Smith 
Publication date: 6 March 2018
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/421ee409dd06d3656b1fccadc1ffb20d170facd9
Recommendations
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
- The Mixed Integer Linear Bilevel Programming Problem
- Global optimization of mixed-integer bilevel programming problems
- An algorithm for the mixed-integer nonlinear bilevel programming problem
Cites Work
- Bilevel road pricing: theoretical analysis and optimality conditions
- Bilevel programming in traffic planning: Models, methods and challenge
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Necessary optimality conditions in pessimistic bilevel programming
- Pessimistic bilevel optimization
- New necessary optimality conditions in optimistic bilevel programming
- Global solution of bilevel programs with a nonconvex inner program
- Global solution of nonlinear mixed-integer bilevel programs
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
- On the solution of convex bilevel optimization problems
- Optimality conditions for bilevel programming problems
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
- Canonical Cuts on the Unit Hypercube
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- An extended Kuhn-Tucker approach for linear bilevel programming
- Deterministic network interdiction
- A bilevel model of taxation and its application to optimal highway pricing
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- Parametric global optimisation for bilevel programming
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- An extended branch and bound algorithm for linear bilevel programming
- KKT reformulation and necessary conditions for optimality in nonsmooth bilevel optimization
- An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
- The Mixed Integer Linear Bilevel Programming Problem
- Shortest-path network interdiction
- Bilevel programming with discrete lower level problems
- A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
- Parametric integer programming algorithm for bilevel mixed integer programs
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Title not available (Why is that?)
- Discrete bilevel programming: application to a natural gas cash-out problem
- A linearization approach to solve the natural gas cash-out bilevel problem
- Natural gas bilevel cash-out problem: convergence of a penalty function method
- A global optimization approach for the linear two-level program
- Robust counterparts of inequalities containing sums of maxima of linear functions
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- A Backward Sampling Framework for Interdiction Problems with Fortification
Cited In (56)
- Solving a class of two-stage stochastic nonlinear integer programs using value functions
- A framework for generalized Benders' decomposition and its application to multilevel optimization
- Bilevel optimization to deal with demand response in power grids: models, methods and challenges
- Integrating link-based discrete credit charging scheme into discrete network design problem
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Feature selection for classification models via bilevel optimization
- The maximum clique interdiction problem
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- Intersection cuts for bilevel optimization
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- 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 a class of bilevel linear mixed-integer programs in adversarial settings
- A deterministic bounding algorithm vs. a hybrid meta-heuristic to deal with a bilevel mixed-integer nonlinear optimization model for electricity dynamic pricing
- On bilevel optimization with inexact follower
- 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
- Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds
- A survey of network interdiction models and algorithms
- Interdicting restructuring networks with applications in illicit trafficking
- A unified framework for multistage mixed integer linear optimization
- Rejection-proof mechanisms for multi-agent kidney exchange
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems
- Global optimization of mixed-integer bilevel programming problems
- A class of algorithms for mixed-integer bilevel min-max optimization
- Exact solution approaches for bilevel lot-sizing
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
- Parametric integer programming algorithm for bilevel mixed integer programs
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- A value function-based approach for robust surgery planning
- 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
- A survey on mixed-integer programming techniques in bilevel optimization
- A Gilmore-Gomory construction of integer programming value functions
- The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling
- Exact solution approaches for a class of bilevel fractional programs
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Mixed-integer bilevel representability
- Bilevel Integer Programs with Stochastic Right-Hand Sides
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- 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 optimization: theory, algorithms, applications and a bibliography
- Methods for pessimistic bilevel optimization
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
- A generic optimization framework for resilient systems
- Solution techniques for bi-level knapsack problems
- An exact solution algorithm for integer bilevel programming with application in energy market optimization
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- Using neural networks to solve linear bilevel problems with unknown lower level
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
Uses Software
This page was built for publication: A value-function-based exact approach for the bilevel mixed-integer programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604908)
