Computing network tolls with support constraints
From MaRDI portal
Recommendations
Cited in
(25)- Selfish routing in public services
- Toll caps in privatized road networks
- The minimum tollbooth problem in atomic network congestion games with unsplittable flows
- Computation of the optimal tolls on the traffic network
- Approach to congestion optimum toll in traffic networks.
- A polyhedral study of the network pricing problem with connected toll arcs
- Combinatorial Benders cuts for the minimum tollbooth problem
- An extended network interdiction problem for optimal toll control
- New complexity results and algorithms for the minimum tollbooth problem
- scientific article; zbMATH DE number 1086905 (Why is no real title available?)
- Network-Optimized Road Pricing: Part II: Algorithms and Examples
- Network pricing problem with unit toll
- Solving the minimum toll revenue problem in real transportation networks
- Selfishness need not be bad
- Demand-independent optimal tolls
- scientific article; zbMATH DE number 7378728 (Why is no real title available?)
- Parametric computation of minimum-cost flows with piecewise quadratic costs
- Wealth Inequality and the Price of Anarchy
- On the minimization of traffic congestion in road networks with tolls
- Pricing toll roads under uncertainty
- Pareto-improving congestion pricing on multimodal transportation networks
- Relaxed toll sets for congestion pricing problems
- A heuristic method for the minimum toll booth problem
- Congestion games with priority-based scheduling
- Simultaneously optimizing link tolls and signal settings in a road network
This page was built for publication: Computing network tolls with support constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642456)
