Pages that link to "Item:Q4685727"
From MaRDI portal
The following pages link to Methodological Advances and New Formulations for Bilevel Network Design Problems (Q4685727):
Displaying 6 items.
- A branch and bound algorithm for bi-level discrete network design problem (Q264253) (← links)
- A dynamic discrete network design problem for maintenance planning in traffic networks (Q1695774) (← links)
- An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model (Q2116857) (← links)
- Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities (Q2253496) (← links)
- A cutting plane approach for bilevel hazardous material transport network design (Q2376731) (← links)
- A bi-level formula and quasi-Newtonian algorithm for stochastic equilibrium network design problem with elastic demand (Q5941787) (← links)
