The traffic assignment problem (TAP) with elastic demands can be formulated as an optimization problem, the objective of which is the sum of a congestion function and a disutility function. We propose ...
Graph theoretic relaxations are used to design tree search algorithms for set-covering and set-partitioning problems. In this paper two assignment relaxations for the set-covering and set-partitioning ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback