An exact ILP models the combined capacitated subnetwork design and dynamic shortest-path routing problem, with experiments showing that fixing routes first and deactivating unused links yields near-optimal solutions.
¨Uber ein Paradoxon aus der V erkehrsplanung
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Introduces neighbourhood balancing games on weighted graphs as generalizations of Wardrop and congestion games and studies equilibria existence and efficiency.
citing papers explorer
-
Nonatomic Non-Cooperative Neighbourhood Balancing Games
Introduces neighbourhood balancing games on weighted graphs as generalizations of Wardrop and congestion games and studies equilibria existence and efficiency.