On the use of intersection cuts for bilevel optimization
From MaRDI portal
Publication:1800991
DOI10.1007/s10107-017-1189-5zbMath1406.90082OpenAlexW2754261171WikidataQ62048259 ScholiaQ62048259MaRDI QIDQ1800991
Markus Sinnl, Michele Monaci, Matteo Fischetti, Ivana Ljubić
Publication date: 26 October 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11585/656439
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Managing Product Transitions: A Bilevel Programming Approach, SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs, Bilevel Integer Programs with Stochastic Right-Hand Sides, A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games, Multi-stage optimal design of road networks for automated vehicles with elastic multi-class demand, The leader multipurpose shopping location problem, Solution techniques for bi-level knapsack problems, Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem, Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem, On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty, Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds, A survey on mixed-integer programming techniques in bilevel optimization, An exact approach for the bilevel knapsack problem with interdiction constraints and extensions, On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level, An exact method for binary fortification games, Presolving linear bilevel optimization problems, Mixed-integer bilevel representability, A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation, Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints, A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts, The impact of neighboring markets on renewable locations, transmission expansion, and generation investment, An enhanced branch-and-bound algorithm for bilevel integer linear programming, Outer approximation for global optimization of mixed-integer quadratic bilevel problems, On tackling reverse convex constraints for non-overlapping of unequal circles, 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, A Unified Framework for Multistage Mixed Integer Linear Optimization, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy
Uses Software
Cites Work
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Bilevel programming and the separation problem
- Enhanced exact algorithms for discrete bilevel linear problems
- Parametric integer programming algorithm for bilevel mixed integer programs
- SCIP: solving constraint integer programs
- Weak via strong Stackelberg problem: New results
- Global solution of nonlinear mixed-integer bilevel programs
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Disjunctive cuts for continuous linear bilevel programming
- Intersection Cuts for Bilevel Optimization
- Integer Programming
- The Mixed Integer Linear Bilevel Programming Problem
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Benchmarking optimization software with performance profiles.
