Pages that link to "Item:Q2493262"
From MaRDI portal
The following pages link to Global optimization of mixed-integer bilevel programming problems (Q2493262):
Displaying 29 items.
- A genetic algorithm using a finite search space for solving nonlinear/linear fractional bilevel programming problems (Q256666) (← links)
- A bilevel formulation of the pediatric vaccine pricing problem (Q320740) (← links)
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions (Q336816) (← links)
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing (Q336824) (← links)
- A bilevel programming problem with maximization of a supermodular function in the lower level (Q385481) (← links)
- Mixed convexity and optimization results for an \((S-1,S)\) inventory model under a time limit on backorders (Q395687) (← links)
- Optimizing system resilience: a facility protection model with recovery time (Q439415) (← links)
- Model building using bi-level optimization (Q620522) (← links)
- Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution (Q621684) (← links)
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
- Parametric integer programming algorithm for bilevel mixed integer programs (Q711715) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Solving discrete linear bilevel optimization problems using the optimal value reformulation (Q1675551) (← links)
- Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches (Q1683064) (← links)
- On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory (Q1683323) (← links)
- A single-level reformulation of mixed integer bilevel programming problems (Q1727937) (← links)
- A bilevel fixed charge location model for facilities under imminent attack (Q1762124) (← links)
- Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
- Global solution of nonlinear mixed-integer bilevel programs (Q1959230) (← links)
- Integrating link-based discrete credit charging scheme into discrete network design problem (Q1991119) (← links)
- A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem (Q2029945) (← links)
- A bi-level model and memetic algorithm for arc interdiction location-routing problem (Q2244003) (← links)
- Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities (Q2245701) (← links)
- Resolution method for mixed integer bi-level linear problems based on decomposition technique (Q2271156) (← links)
- Solving multi-period interdiction via generalized Bender's decomposition (Q2401773) (← links)
- Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution (Q2676299) (← links)
- An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems (Q2822279) (← links)
- Lagrangean relaxation-based algorithm for bi-level problems (Q2943804) (← links)
- An exact solution algorithm for integer bilevel programming with application in energy market optimization (Q6103704) (← links)