Pages that link to "Item:Q3989989"
From MaRDI portal
The following pages link to An algorithm for the discrete bilevel programming problem (Q3989989):
Displaying 50 items.
- A class of algorithms for mixed-integer bilevel min-max optimization (Q330266) (← 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 bi-level programming model for protection of hierarchical facilities under imminent attacks (Q342087) (← links)
- Enhanced exact algorithms for discrete bilevel linear problems (Q499703) (← links)
- Designing robust coverage networks to hedge against worst-case facility losses (Q617512) (← links)
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
- Bilevel model for production-distribution planning solved by using ant colony optimization (Q709146) (← links)
- Optimizing power generation in the presence of micro-grids (Q724120) (← links)
- A dynamic programming algorithm for the bilevel Knapsack problem (Q833584) (← links)
- Interactive compensatory fuzzy programming for decentralized multi-level linear programming (DMLLP) problems (Q869137) (← links)
- Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice (Q971769) (← links)
- Solving bilevel linear programs using multiple objective linear programming (Q1016404) (← links)
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem (Q1266629) (← links)
- Bilevel and multilevel programming: A bibliography review (Q1338535) (← links)
- Links between linear bilevel and mixed 0-1 programming problems (Q1379953) (← links)
- A bilevel bottleneck programming problem (Q1390218) (← links)
- Interactive fuzzy programming for multi-level 0-1 programming problems with fuzzy parameters through genetic algorithms (Q1595198) (← links)
- Numerical analysis of algorithms for solving bicriteria discrete programming problems (Q1608267) (← links)
- Multilevel decision-making: a survey (Q1615283) (← links)
- Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577) (← links)
- Solving discrete linear bilevel optimization problems using the optimal value reformulation (Q1675551) (← links)
- Integer programming formulations for three sequential discrete competitive location problems with foresight (Q1681140) (← 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)
- Radio communications interdiction problem under deterministic and probabilistic jamming (Q1738838) (← links)
- Optimal sensor deployment to increase the security of the maximal breach path in border surveillance (Q1751769) (← links)
- Discrete linear bilevel programming problem (Q1918022) (← links)
- An exact algorithm for bilevel 0-1 knapsack problems (Q1954852) (← links)
- Indefinite quadratic integer bilevel programming problem with bounded variables (Q1956480) (← links)
- An effective bilevel programming approach for the evasive flow capturing location problem (Q2005787) (← links)
- An enhanced branch-and-bound algorithm for bilevel integer linear programming (Q2030724) (← links)
- Tri-level mixed-binary linear programming: solution approaches and application in defending critical infrastructure (Q2076898) (← links)
- A framework for generalized Benders' decomposition and its application to multilevel optimization (Q2097644) (← links)
- Bilevel optimization problems of distribution of interbudgetary transfers under given limitations (Q2174044) (← links)
- Mixed-integer bilevel representability (Q2220657) (← links)
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913) (← links)
- The bilevel optimisation of a multi-agent project scheduling and staffing problem (Q2239938) (← links)
- Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks (Q2242189) (← links)
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints (Q2274885) (← links)
- A bi-level programming model and solution algorithm for the location of logistics distribution centers (Q2470316) (← links)
- A study on the use of heuristics to solve a bilevel programming problem (Q2806437) (← links)
- A Cutting Plane Approach for Solving Linear Bilevel Programming Problems (Q2808063) (← 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 ALGORITHM FOR SOLVING RULE SETS-BASED BILEVEL DECISION PROBLEMS (Q3224878) (← links)
- COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL INTEGER PROGRAMMING PROBLEMS (Q3369494) (← links)
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms (Q3565458) (← links)
- Bilevel programming with discrete lower level problems (Q3648627) (← links)
