A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
From MaRDI portal
Publication:1751159
DOI10.1016/j.disopt.2016.04.001zbMath1387.90135OpenAlexW2342751337WikidataQ124841720 ScholiaQ124841720MaRDI QIDQ1751159
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2016.04.001
Related Items (19)
Managing Product Transitions: A Bilevel Programming Approach ⋮ Exact method for the capacitated competitive facility location problem ⋮ Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets ⋮ Cut generation algorithm for the discrete competitive facility location problem ⋮ Bilevel optimization for joint scheduling of production and energy systems ⋮ A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem ⋮ The rank pricing problem: models and branch-and-cut algorithms ⋮ A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation ⋮ Approximation of the competitive facility location problem with MIPs ⋮ A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs ⋮ Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints ⋮ An enhanced branch-and-bound algorithm for bilevel integer linear programming ⋮ A Cut Generation Algorithm of Finding an Optimal Solution in a Market Competition ⋮ The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem ⋮ \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario ⋮ Multilevel Approaches for the Critical Node Problem ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
- The bilevel knapsack problem with stochastic right-hand sides
- Global solution of bilevel programs with a nonconvex inner program
- Practical bilevel optimization. Algorithms and applications
- Bilevel and multilevel programming: A bibliography review
- Multilevel optimization: algorithms and applications
- A note on `bilevel linear fractional programming problem'.
- Foundations of bilevel programming
- A hybrid tabu-ascent algorithm for the linear bilevel programming problem
- Linear bilevel programming solution by genetic algorithm
- Global solution of nonlinear mixed-integer bilevel programs
- A bilevel mixed-integer program for critical infrastructure protection planning
- Parametric global optimisation for bilevel programming
- New branch-and-Cut algorithm for bilevel linear programming
- An overview of bilevel optimization
- New product introduction against a predator: A bilevel mixed-integer programming approach
- An algorithm for the integer linear fractional bilevel programming problem
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Two-Level Linear Programming
- The Mixed Integer Linear Bilevel Programming Problem
- Benchmarking optimization software with performance profiles.
This page was built for publication: A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
