Pages that link to "Item:Q2806437"
From MaRDI portal
The following pages link to A study on the use of heuristics to solve a bilevel programming problem (Q2806437):
Displaying 13 items.
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm (Q2176276) (← links)
- Robust bi-level optimization of relief logistics operations (Q2295217) (← links)
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences (Q2422923) (← links)
- A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand (Q2664382) (← links)
- Bilevel “Defender–Attacker” Model with Multiple Attack Scenarios (Q4558293) (← links)
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method (Q4995065) (← links)
- Approximate Bilevel Optimization with Population-Based Evolutionary Algorithms (Q5014635) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- Metaheuristics for bilevel optimization: a comprehensive review (Q6065604) (← links)
- Coordinating harvest planning and scheduling in an agricultural supply chain through a stochastic bilevel programming (Q6079930) (← links)
- Focus programming: a bi‐level programming approach to static stochastic optimization problems (Q6080615) (← links)
- A game‐theoretic approach for the location of terror response facilities with both disruption risk and hidden information (Q6091866) (← links)
- An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach (Q6160968) (← links)
