Pages that link to "Item:Q1751159"
From MaRDI portal
The following pages link to A mixed-integer bilevel programming approach for a competitive prioritized set covering problem (Q1751159):
Displaying 20 items.
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
- Exact method for the capacitated competitive facility location problem (Q1652629) (← links)
- Cut generation algorithm for the discrete competitive facility location problem (Q1673703) (← links)
- The rank pricing problem: models and branch-and-cut algorithms (Q1722958) (← links)
- Approximation of the competitive facility location problem with MIPs (Q1725607) (← links)
- An enhanced branch-and-bound algorithm for bilevel integer linear programming (Q2030724) (← links)
- A framework for generalized Benders' decomposition and its application to multilevel optimization (Q2097644) (← links)
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913) (← links)
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints (Q2274885) (← links)
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario (Q2308185) (← links)
- New product introduction against a predator: A bilevel mixed-integer programming approach (Q3655566) (← links)
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem (Q4604908) (← links)
- A Cut Generation Algorithm of Finding an Optimal Solution in a Market Competition (Q4973247) (← links)
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem (Q4976158) (← links)
- Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
- A Unified Framework for Multistage Mixed Integer Linear Optimization (Q5014640) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- Managing Product Transitions: A Bilevel Programming Approach (Q5058022) (← links)
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets (Q5084616) (← links)
- Bilevel optimization for joint scheduling of production and energy systems (Q6159497) (← links)
