Links between linear bilevel and mixed 0-1 programming problems
From MaRDI portal
(Redirected from Publication:1379953)
Recommendations
Cites work
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A linear max—min problem
- A sequential LCP method for bilevel linear programming
- Algorithms for solving the mixed integer two-level linear programming problem
- An investigation of the linear three level programming problem
- Bilevel and multilevel programming: A bibliography review
- Bilevel linear programming
- Computational Difficulties of Bilevel Linear Programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Discrete linear bilevel programming problem
- Links between linear bilevel and mixed 0-1 programming problems
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On the structure and properties of a linear multilevel programming problem
- On two-level optimization
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- Some properties of the bilevel programming problem
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
- The computational complexity of multi-level linear programs
- The hybrid algorithm for solving the three-level linear programming problem
- The polynomial hierarchy and a simple model for competitive analysis
Cited in
(62)- Disjunctive cuts for continuous linear bilevel programming
- On complexity of finding strong-weak solutions in bilevel linear programming
- A single-level reformulation of mixed integer bilevel programming problems
- On the solution of convex bilevel optimization problems
- Detecting and solving aircraft conflicts using bilevel programming
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
- A pivoting algorithm for linear programming with linear complementarity constraints
- A short note on the mixed (0,\,1) linear fractional programming problem
- Feature selection for classification models via bilevel optimization
- Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy
- A partial cooperation model for non-unique linear two-level decision problems
- A computational analysis of LCP methods for bilinear and concave quadratic programming
- Sequential interdiction with incomplete information and learning
- A note on linearized reformulations for a class of bilevel linear integer problems
- Optimization-free robust MPC around the terminal region
- Inverse optimization with noisy data
- On a class of bilevel linear mixed-integer programs in adversarial settings
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Links between linear bilevel and mixed 0-1 programming problems
- Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
- Bilevel Programming: The Montreal School
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- The standard pessimistic bilevel problem
- Reformulations in Mathematical Programming: Definitions and Systematics
- Complexity of near-optimal robust versions of multilevel optimization problems
- Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- On bilevel optimization with inexact follower
- Technical note -- There's no free lunch: on the hardness of choosing a correct big-\(M\) in bilevel optimization
- On a stochastic bilevel programming problem
- An approach to the distributionally robust shortest path problem
- Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds
- A computational study for bilevel quadratic programs using semidefinite relaxations
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- A smoothing heuristic for a bilevel pricing problem
- A note on the definition of a linear bilevel programming solution
- An overview of bilevel optimization
- Editorial: Reformulation techniques in mathematical programming
- A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem
- Bilevel optimization applied to strategic pricing in competitive electricity markets
- Finding critical links for closeness centrality
- Enumeration-based approach to solving parametric linear complementarity problems
- New branch-and-Cut algorithm for bilevel linear programming
- Equilibrium network design of shared-vehicle systems
- Integer programming methods for solving binary interdiction games
- A note on the Pareto optimality of solutions to the linear bilevel programming problem
- Exact solution approaches for a class of bilevel fractional programs
- A survey on mixed-integer programming techniques in bilevel optimization
- Mixed-integer bilevel representability
- Bilevel Integer Programs with Stochastic Right-Hand Sides
- Enhanced exact algorithms for discrete bilevel linear problems
- Optimal configuration of gamma ray machine radiosurgery units: The sphere covering subproblem
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Granularity in nonlinear mixed-integer optimization
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- A simple greedy heuristic for linear assignment interdiction
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
- Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm
- On the \(p\)-hub interdiction problem
This page was built for publication: Links between linear bilevel and mixed 0-1 programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379953)
