Pages that link to "Item:Q264253"
From MaRDI portal
The following pages link to A branch and bound algorithm for bi-level discrete network design problem (Q264253):
Displaying 13 items.
- A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions (Q264305) (← links)
- A sustainable road network design problem with land use transportation interaction over time (Q298899) (← links)
- Integration of selecting and scheduling urban road construction projects as a time-dependent discrete network design problem (Q319862) (← links)
- A multi-objective integrated model for selecting, scheduling, and budgeting road construction projects (Q724091) (← links)
- An alternative approach for solving the environmentally-oriented discrete network design problem (Q1642955) (← links)
- Complex interactions in large government networks (Q1654576) (← links)
- A dynamic discrete network design problem for maintenance planning in traffic networks (Q1695774) (← 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)
- The cost of environmental constraints in traffic networks: assessing the loss of optimality (Q2357885) (← links)
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design (Q2357911) (← links)
- A traffic restriction scheme for enhancing carpooling (Q2398794) (← links)
- BO-B\&B: a hybrid algorithm based on Bayesian optimization and branch-and-bound for discrete network design problems (Q2699090) (← links)