Pages that link to "Item:Q2271156"
From MaRDI portal
The following pages link to Resolution method for mixed integer bi-level linear problems based on decomposition technique (Q2271156):
Displayed 15 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)
- Model building using bi-level optimization (Q620522) (← 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)