A note on linearized reformulations for a class of bilevel linear integer problems
From MaRDI portal
Publication:1730617
DOI10.1007/S10479-017-2694-XzbMath1411.90228OpenAlexW2770478654MaRDI QIDQ1730617
Bo Zeng, Juan S. Borrero, M. Hosein Zare, Oleg A. Prokopyev
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2694-x
Related Items (17)
On exact solution approaches for bilevel quadratic 0-1 knapsack problem ⋮ Benders Subproblem Decomposition for Bilevel Problems with Convex Follower ⋮ Optimal storage and transmission investments in a bilevel electricity market model ⋮ Integer programming methods for solving binary interdiction games ⋮ Exact solution approaches for a class of bilevel fractional programs ⋮ Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ On Bilevel Optimization with Inexact Follower ⋮ Detecting and solving aircraft conflicts using bilevel programming ⋮ An enhanced branch-and-bound algorithm for bilevel integer linear programming ⋮ Closing the gap in linear bilevel optimization: a new valid primal-dual inequality ⋮ Outer approximation for global optimization of mixed-integer quadratic bilevel problems ⋮ Sequential Interdiction with Incomplete Information and Learning ⋮ The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling ⋮ Solving certain complementarity problems in power markets via convex programming ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
Uses Software
Cites Work
- Exact solution approaches for bilevel assignment problems
- An integer linear programming approach for bilinear integer programming
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Matching interdiction
- Bilevel programming: a survey
- A note on a global approach for general 0-1 fractional programming
- Multilevel optimization: algorithms and applications
- Links between linear bilevel and mixed 0-1 programming problems
- A note on a modified simplex approach for solving bilevel linear programming problems
- Foundations of bilevel programming
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- Linear forms of nonlinear expressions: new insights on old ideas
- An improved linearization strategy for zero-one quadratic programming problems
- New branch-and-Cut algorithm for bilevel linear programming
- An overview of bilevel optimization
- Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
- Solving Mixed Integer Bilinear Problems Using MILP Formulations
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- The polynomial hierarchy and a simple model for competitive analysis
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Finding the n Most Vital Nodes in a Flow Network
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Maximizing the minimum source-sink path subject to a budget constraint
- Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
- A Complexity and Approximability Study of the Bilevel Knapsack Problem
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Two-Level Linear Programming
This page was built for publication: A note on linearized reformulations for a class of bilevel linear integer problems
