Pages that link to "Item:Q336802"
From MaRDI portal
The following pages link to Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints (Q336802):
Displaying 13 items.
- The combination of continuous network design and route guidance (Q342420) (← links)
- Uncertain random multilevel programming with application to production control problem (Q521686) (← links)
- A multi-objective integrated model for selecting, scheduling, and budgeting road construction projects (Q724091) (← links)
- Managing congestion and emissions in transportation networks with dynamic carbon credit charge scheme (Q1654353) (← links)
- Managing rush hour congestion with Lane reversal and tradable credits (Q1717721) (← links)
- Optimal tradable credits scheme and congestion pricing with the efficiency analysis to congestion (Q1723515) (← links)
- Integrating link-based discrete credit charging scheme into discrete network design problem (Q1991119) (← links)
- An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes (Q1994496) (← links)
- Tradable credit scheme for control of evolutionary traffic flows to system optimum: model and its convergence (Q2005870) (← links)
- Optimal design of differentiated credit charging links in mixed-autonomy transportation networks (Q2109642) (← links)
- Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs (Q2664438) (← links)
- Multi-stage optimal design of road networks for automated vehicles with elastic multi-class demand (Q2669582) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)