Pages that link to "Item:Q2271156"

The following pages link to Resolution method for mixed integer bi-level linear problems based on decomposition technique (Q2271156):

Displaying 43 items.

• Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing (Q264277) (← links)
• Optimizing dynamic investment decisions for railway systems protection (Q320718) (← links)
• A continuous bi-level model for the expansion of highway networks (Q336804) (← 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)
• Optimizing system resilience: a facility protection model with recovery time (Q439415) (← links)
• Uncertain random multilevel programming with application to production control problem (Q521686) (← links)
• Model building using bi-level optimization (Q620522) (← links)
• A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
• Bilevel programming and applications (Q1665319) (← links)
• Solving discrete linear bilevel optimization problems using the optimal value reformulation (Q1675551) (← 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)
• Optimizing fortification plan of capacitated facilities with maximum distance limits (Q1735969) (← links)
• Optimal sensor deployment to increase the security of the maximal breach path in border surveillance (Q1751769) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• On the use of intersection cuts for bilevel optimization (Q1800991) (← links)
• Integrating link-based discrete credit charging scheme into discrete network design problem (Q1991119) (← 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)
• A framework for generalized Benders' decomposition and its application to multilevel optimization (Q2097644) (← links)
• An exact algorithm for solving the bilevel facility interdiction and fortification problem (Q2294241) (← links)
• A survey of network interdiction models and algorithms (Q2294622) (← links)
• A weighting method for 0-1 indefinite quadratic bilevel programming (Q2359528) (← links)
• Solving multi-period interdiction via generalized Bender's decomposition (Q2401773) (← links)
• Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems (Q2423815) (← links)
• A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints (Q2442073) (← links)
• An interior-point Benders based branch-and-cut algorithm for mixed integer programs (Q2442074) (← links)
• Speed-up Benders decomposition using maximum density cut (MDC) generation (Q2442077) (← links)
• Optimal engineering design via Benders' decomposition (Q2442087) (← links)
• Estimating the parameters of a fatigue model using Benders' decomposition (Q2442091) (← links)
• A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints (Q2629907) (← links)
• Accelerating Benders method using covering cut bundle generation (Q3563624) (← links)
• A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem (Q4604908) (← 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 Integer Programs with Stochastic Right-Hand Sides (Q5084620) (← links)
• Benders Subproblem Decomposition for Bilevel Problems with Convex Follower (Q5087737) (← links)
• Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach (Q6065889) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)