作者: Donald W. Hearn , Siriphong Lawphongpanich , Sang Nguyen
DOI: 10.1016/0191-2615(84)90017-1
关键词:
摘要: Abstract Recently introduced optimization formulations of the asymmetric traffic assignment problem are developed. The duality two is shown, and conditions for convexity differentiability objective functions given. Convexity also given family recently by Smith (1983). When travel cost vector affine monotone, all shown to be convex programming problems. Algorithmic implications results discussed.