Bicriterion Shortest Path Problem with a General Nonadditive Cost

[1]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[2]  W. Vickrey.  Congestion Theory and Transport Investment , 1969 .

[3]  J. Henderson.  Road congestion : A reconsideration of pricing theory , 1974 .

[4]  R. Dial.  A MODEL AND ALGORITHM FOR MULTICRITERIA ROUTE-MODE CHOICE , 1979 .

[5]  F. Glover,et al.  A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

[6]  Chris Hendrickson,et al.  Schedule Delay and Departure Time Decisions in a Deterministic Model , 1981 .

[7]  Kenneth A. Small,et al.  THE SCHEDULING OF CONSUMER ACTIVITIES: WORK TRIPS , 1982 .

[8]  M. I. Henig.  The shortest path problem with two objective functions , 1986 .

[9]  P. Mirchandani,et al.  Routing with nonlinear multiattribute cost functions , 1993 .

[10]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[11]  F. Leurent.  Cost versus time equilibrium over a network , 1993 .

[12]  Patrice Marcotte,et al.  IMPLEMENTATION OF AN EFFICIENT ALGORITHM FOR THE MULTICLASS TRAFFIC ASSIGNMENT PROBLEM. , 1995 .

[13]  David Bernstein,et al.  The Traffic Equilibrium Problem with Nonadditive Path Costs , 1995, Transp. Sci..

[14]  Robert B. Dial,et al.  Bicriterion traffic assignment : Efficient algorithms plus examples , 1997 .

[15]  Panos M. Pardalos,et al.  Network Optimization , 1997 .

[16]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[17]  David Bernstein,et al.  NONADDITIVE SHORTEST PATHS , 1999 .

[18]  Hong Kam Lo,et al.  Traffic equilibrium problem with route-specific costs: formulation and algorithms , 2000 .

[19]  Der-Horng Lee,et al.  Uncoupled Method for Equilibrium-Based Linear Path Flow Estimator for Origin-Destination Trip Matrices , 2002 .

[20]  Christos D. Zaroliagis,et al.  Non-additive Shortest Paths , 2004, ESA.

[21]  Eiichi Taniguchi,et al.  Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows , 2006 .

[22]  Hai Yang,et al.  Nonlinear pricing of taxi services , 2010 .

[23]  A. Sumalee,et al.  Efficiency and equity comparison of cordon- and area-based road pricing schemes using a trip-chain equilibrium model , 2007 .

[24]  Masao Fukushima,et al.  The traffic equilibrium problem with nonadditive costs and its monotone mixed complementarity problem formulation , 2007 .

[25]  R. K. Wood,et al.  Lagrangian relaxation and enumeration for solving constrained shortest-path problems , 2008 .

[26]  Tito Homem-de-Mello,et al.  Optimal Path Problems with Second-Order Stochastic Dominance Constraints , 2012 .

[27]  Dongjoo Park,et al.  Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs , 2010, Appl. Math. Comput..

[28]  Xiaojun Chen,et al.  Robust Wardrop’s user equilibrium assignment under stochastic demand and supply: Expected residual minimization approach , 2011 .

[29]  Hai Yang,et al.  Managing network mobility with tradable credits , 2011 .

[30]  Yafeng Yin,et al.  Nonlinear pricing on transportation networks , 2011 .

[31]  Hillel Bar-Gera,et al.  User-equilibrium route flows and the condition of proportionality , 2012 .

[32]  Yu Nie,et al.  Transaction costs and tradable mobility credits , 2012 .

[33]  Mogens Fosgerau,et al.  Using prospect theory to investigate the low marginal value of travel time for small time changes , 2012 .