Pages that link to "Item:Q1379953"
From MaRDI portal
The following pages link to Links between linear bilevel and mixed 0-1 programming problems (Q1379953):
Displaying 50 items.
- On the solution of convex bilevel optimization problems (Q263155) (← links)
- A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
- Enhanced exact algorithms for discrete bilevel linear problems (Q499703) (← links)
- A simple greedy heuristic for linear assignment interdiction (Q513608) (← links)
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games (Q868531) (← links)
- Enumeration-based approach to solving parametric linear complementarity problems (Q901133) (← links)
- A note on the definition of a linear bilevel programming solution (Q945371) (← links)
- Optimal configuration of gamma ray machine radiosurgery units: The sphere covering subproblem (Q1001331) (← links)
- Editorial: Reformulation techniques in mathematical programming (Q1025983) (← links)
- A computational analysis of LCP methods for bilinear and concave quadratic programming (Q1184453) (← links)
- Links between linear bilevel and mixed 0-1 programming problems (Q1379953) (← links)
- A partial cooperation model for non-unique linear two-level decision problems (Q1600980) (← links)
- Optimization-free robust MPC around the terminal region (Q1626887) (← links)
- A single-level reformulation of mixed integer bilevel programming problems (Q1727937) (← links)
- A note on linearized reformulations for a class of bilevel linear integer problems (Q1730617) (← links)
- Feature selection for classification models via bilevel optimization (Q1734837) (← links)
- On a class of bilevel linear mixed-integer programs in adversarial settings (Q1754450) (← links)
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches (Q1754747) (← links)
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope (Q1789596) (← links)
- An efficient compact quadratic convex reformulation for general integer quadratic programs (Q1938903) (← links)
- Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm (Q1959233) (← links)
- Exact solution approach for a class of nonlinear bilevel knapsack problems (Q2018478) (← links)
- Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy (Q2116889) (← links)
- Mixed-integer bilevel representability (Q2220657) (← links)
- Complexity of near-optimal robust versions of multilevel optimization problems (Q2230787) (← links)
- Detecting and solving aircraft conflicts using bilevel programming (Q2231332) (← links)
- Equilibrium network design of shared-vehicle systems (Q2256243) (← links)
- Granularity in nonlinear mixed-integer optimization (Q2302751) (← links)
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario (Q2308185) (← links)
- Disjunctive cuts for continuous linear bilevel programming (Q2463829) (← links)
- New branch-and-Cut algorithm for bilevel linear programming (Q2471104) (← links)
- Bilevel optimization applied to strategic pricing in competitive electricity markets (Q2479837) (← links)
- An overview of bilevel optimization (Q2480262) (← links)
- A smoothing heuristic for a bilevel pricing problem (Q2503215) (← links)
- Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach (Q2569100) (← links)
- A note on the Pareto optimality of solutions to the linear bilevel programming problem (Q2638930) (← links)
- On the \(p\)-hub interdiction problem (Q2664408) (← links)
- An approach to the distributionally robust shortest path problem (Q2668652) (← links)
- Integer programming methods for solving binary interdiction games (Q2672065) (← links)
- Exact solution approaches for a class of bilevel fractional programs (Q2679008) (← links)
- Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems (Q2796798) (← links)
- A pivoting algorithm for linear programming with linear complementarity constraints (Q2885465) (← links)
- On a stochastic bilevel programming problem (Q2892149) (← links)
- Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm (Q3225088) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- Inverse Optimization with Noisy Data (Q4971385) (← links)
- Sequential Interdiction with Incomplete Information and Learning (Q4971578) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
