Pages that link to "Item:Q604959"
From MaRDI portal
The following pages link to A heuristic method for the minimum toll booth problem (Q604959):
Displaying 9 items.
- Solving the minimum toll revenue problem in real transportation networks (Q497449) (← links)
- On the minimization of traffic congestion in road networks with tolls (Q513622) (← links)
- The minimum tollbooth problem in atomic network congestion games with unsplittable flows (Q2230724) (← links)
- A surrogate-based multiobjective metaheuristic and network degradation simulation model for robust toll pricing (Q2254186) (← links)
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation (Q2505552) (← links)
- Empirical study of the greedy heuristic as applied to the link selection problem (Q2516854) (← links)
- Combinatorial Benders Cuts for the Minimum Tollbooth Problem (Q3100444) (← links)
- New Complexity Results and Algorithms for the Minimum Tollbooth Problem (Q3460779) (← links)
- (Q5002840) (← links)