A modified active set algorithm for transportation discrete network design bi-level problem
From MaRDI portal
(Redirected from Publication:506465)
Recommendations
- A branch and bound algorithm for bi-level discrete network design problem
- A stochastic user equilibrium assignment problem in discrete network design problem
- Bilevel programming model and solution method for mixed transportation network design problem
- Genetic algorithm for multiuser discrete network design problem under demand uncertainty
- Bicriterion discrete equilibrium network design problem
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 50596 (Why is no real title available?)
- A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
- A note on two problems in connexion with graphs
- Aggregation and equilibrium with multinomial logit models
- CONOPT—A Large-Scale GRG Code
- Incremental network optimization: theory and algorithms
- Network flows. Theory, algorithms, and applications.
Cited in
(7)- Integrated intelligence of neuro-evolution with sequential quadratic programming for second-order Lane-Emden pantograph models
- Design of neuro-swarming heuristic solver for multi-pantograph singular delay differential equation
- Designing networks with resiliency to edge failures using two-stage robust optimization
- An alternative approach for solving the environmentally-oriented discrete network design problem
- BO-B\&B: a hybrid algorithm based on Bayesian optimization and branch-and-bound for discrete network design problems
- A branch and bound algorithm for bi-level discrete network design problem
- Bilevel optimization: theory, algorithms, applications and a bibliography
This page was built for publication: A modified active set algorithm for transportation discrete network design bi-level problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506465)
