Pages that link to "Item:Q506465"
From MaRDI portal
The following pages link to A modified active set algorithm for transportation discrete network design bi-level problem (Q506465):
Displaying 7 items.
- A branch and bound algorithm for bi-level discrete network design problem (Q264253) (← links)
- An alternative approach for solving the environmentally-oriented discrete network design problem (Q1642955) (← links)
- Designing networks with resiliency to edge failures using two-stage robust optimization (Q2315627) (← links)
- Integrated intelligence of neuro-evolution with sequential quadratic programming for second-order Lane-Emden pantograph models (Q2664782) (← links)
- BO-B\&B: a hybrid algorithm based on Bayesian optimization and branch-and-bound for discrete network design problems (Q2699090) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- DESIGN OF NEURO-SWARMING HEURISTIC SOLVER FOR MULTI-PANTOGRAPH SINGULAR DELAY DIFFERENTIAL EQUATION (Q5023996) (← links)
