Links between linear bilevel and mixed 0-1 programming problems
From MaRDI portal
Publication:1379953
DOI10.1023/A:1022645805569zbMath0901.90153OpenAlexW1503428021MaRDI QIDQ1379953
Brigitte Jaumard, Gilles Savard, Pierre Hansen, Charles Audet
Publication date: 5 March 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022645805569
Related Items
A pivoting algorithm for linear programming with linear complementarity constraints, On exact solution approaches for bilevel quadratic 0-1 knapsack problem, On a stochastic bilevel programming problem, Optimization-free robust MPC around the terminal region, A computational study for bilevel quadratic programs using semidefinite relaxations, A note on the Pareto optimality of solutions to the linear bilevel programming problem, Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games, Bilevel Integer Programs with Stochastic Right-Hand Sides, Links between linear bilevel and mixed 0-1 programming problems, On the \(p\)-hub interdiction problem, An approach to the distributionally robust shortest path problem, Integer programming methods for solving binary interdiction games, Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm, Exact solution approaches for a class of bilevel fractional programs, Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds, An efficient compact quadratic convex reformulation for general integer quadratic programs, A survey on mixed-integer programming techniques in bilevel optimization, Enumeration-based approach to solving parametric linear complementarity problems, Bilevel Programming: The Montreal School, On Bilevel Optimization with Inexact Follower, Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm, Mixed-integer bilevel representability, Finding Critical Links for Closeness Centrality, A single-level reformulation of mixed integer bilevel programming problems, A note on linearized reformulations for a class of bilevel linear integer problems, Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization, Complexity of near-optimal robust versions of multilevel optimization problems, Feature selection for classification models via bilevel optimization, Detecting and solving aircraft conflicts using bilevel programming, A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem, A computational analysis of LCP methods for bilinear and concave quadratic programming, A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs, Disjunctive cuts for continuous linear bilevel programming, Enhanced exact algorithms for discrete bilevel linear problems, A note on the definition of a linear bilevel programming solution, New branch-and-Cut algorithm for bilevel linear programming, A simple greedy heuristic for linear assignment interdiction, On a class of bilevel linear mixed-integer programs in adversarial settings, Multiple allocation hub interdiction and protection problems: model formulations and solution approaches, Bilevel optimization applied to strategic pricing in competitive electricity markets, An overview of bilevel optimization, Equilibrium network design of shared-vehicle systems, Exact solution approach for a class of nonlinear bilevel knapsack problems, A smoothing heuristic for a bilevel pricing problem, Decomposition for adjustable robust linear optimization subject to uncertainty polytope, Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems, Optimal configuration of gamma ray machine radiosurgery units: The sphere covering subproblem, Reformulations in Mathematical Programming: Definitions and Systematics, Granularity in nonlinear mixed-integer optimization, Inverse Optimization with Noisy Data, Sequential Interdiction with Incomplete Information and Learning, \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario, Editorial: Reformulation techniques in mathematical programming, The Standard Pessimistic Bilevel Problem, Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, A partial cooperation model for non-unique linear two-level decision problems, Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback, Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy, On the solution of convex bilevel optimization problems
Cites Work
- Some properties of the bilevel programming problem
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- On the structure and properties of a linear multilevel programming problem
- The hybrid algorithm for solving the three-level linear programming problem
- The computational complexity of multi-level linear programs
- A sequential LCP method for bilevel linear programming
- Bilevel and multilevel programming: A bibliography review
- Links between linear bilevel and mixed 0-1 programming problems
- Algorithms for solving the mixed integer two-level linear programming problem
- Discrete linear bilevel programming problem
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Bilevel linear programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- An investigation of the linear three level programming problem
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- Computational Difficulties of Bilevel Linear Programming
- The polynomial hierarchy and a simple model for competitive analysis
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- On two-level optimization
- Cones of Matrices and Set-Functions and 0–1 Optimization
- New Branch-and-Bound Rules for Linear Bilevel Programming
- A linear max—min problem
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
