Traffic assignment problem for a general network

From MaRDI portal
Revision as of 03:52, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5595976

DOI10.6028/JRES.073B.010zbMath0197.46003OpenAlexW2006122291MaRDI QIDQ5595976

Frederick T. Sparrow, Stella Dafermos

Publication date: 1969

Published in: Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.6028/jres.073b.010




Related Items (only showing first 100 items - show all)

Financial networks with intermediation: risk management with variable weightsHub location problems with price sensitive demandsCapacitated refueling station location problem with traffic deviations over multiple time periodsEquilibria on a Congested Transportation NetworkOn the relationship between Nash—Cournot and Wardrop equilibriaA regularization of the Frank-Wolfe method and unification of certain nonlinear programming methodsDecentralized optimization of last-mile delivery services with non-cooperative bounded rational customersBounding the inefficiency of equilibria in nonatomic congestion gamesAn algorithm for the classical spatial price equilibrium problemA maximum entropy fixed-point route choice model for route correlationA comparison of dynamic user optimal states with zero, fixed and variable tolerancesAdvances in dynamic traffic assignment: TAC. A new relationship between Wardrop's user equilibrium and Nash equilibriumCompetitive online multicommodity routingA computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demandAn efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraintsPrice competition with elastic trafficThe evolution and emergence of integrated social and financial networks with electronic transactions: A dynamic supernetwork theory for the modeling, analysis, and computation of financial flows and relationship levelsForecasting travel on congested urban transportation networks: Review and prospects for network equilibrium modelsA modified gradient projection algorithm for solving the elastic demand traffic assignment problemA traffic congestion analysis by user equilibrium and system optimum with incomplete informationA general dynamic spatial price equilibrium model: Formulation, solution, and computational resultsDynamic traffic assignment: Considerations on some deterministic modelling approachesColumn generation for the equilibrium route-flow traffic assignment problemA network model and algorithm for the analysis and estimation of financial flow of fundsBilevel programming in traffic planning: Models, methods and challengeAn enhanced dynamic user optimal passenger flow assignment model for metro networksFormulation and analysis of horizontal mergers among oligopolistic firms with insights into the merger paradox: A supply chain network perspectiveFormulation, stability, and computation of traffic network equilibria as projected dynamical systemsSelective bi-coordinate method for limit non-smooth resource allocation type problemsMultiperiod competitive supply chain networks with inventorying and a transportation network equilibrium reformulationRetarded weighted quasi-variational inequalities for traffic equilibrium problemsPricing with markups in industries with increasing marginal costsDemand allocation with latency cost functionsOn the performance of approximate equilibria in congestion gamesThe convergence of equilibrium algorithms with non-monotone line search technique.Dynamics of international financial networks with risk managementA survey of dynamic network flowsA network model of migration equilibrium with movement costsAn efficient solution algorithm for solving multi-class reliability-based traffic assignment problemSelfish splittable flows and NP-completenessA survey on the continuous nonlinear resource allocation problemThe price of anarchy in an exponential multi-serverToll caps in privatized road networksA path-based double projection method for solving the asymmetric traffic network equilibrium problemOptimal routing for multiclass networksSolving multi-objective traffic assignmentThe toll effect on price of anarchy when costs are nonlinear and asymmetricA network equilibrium framework for internet advertising: models, qualitative analysis, and algorithmsA unified network performance measure with importance identification and the ranking of network componentsFinancial networks with intermediation and transportation network equilibria: A supernetwork equivalence and reinterpretation of the equilibrium conditions with computationsThe internet, evolutionary variational inequalities, and the time-dependent Braess paradoxUnnamed ItemHuman migration networksOn the continuous quadratic knapsack problemA new model for selfish routingMulti-product supply chain horizontal network integration: models, theory, and computational resultsNash equilibria in discrete routing games with convex latency functionsImproving the price of anarchy for selfish routing via coordination mechanismsAlgorithms for quadratic constrained matrix problemsTraffic assignment: methods and simulations for an alternative formulation of the fixed demand problemDynamic traffic network equilibrium systemA network efficiency measure with application to critical infrastructure networksExtending the notion of rationality of selfish agents: second order Nash equilibriaStackelberg strategies and collusion in network games with splittable flowOptimal routing of vehicles with communication capabilities in disastersA heuristic algorithm for network equilibrationHow much can taxes help selfish routing?On the severity of Braess's paradox: designing networks for selfish users is hardRefugee migration networks and regulations: a multiclass, multipath variational inequality frameworkEquilibria for networks with malicious usersSensitivity of Wardrop equilibriaA relative total cost index for the evaluation of transportation network robustness in the presence of degradable links and alternative travel behaviorStackelberg Strategies and Collusion in Network Games with Splittable FlowA note on a parameter relating traffic equilibria and system optimal routingAn algorithm for nonlinear multicommodity flow problemsBraess's Paradox in large random graphsA convergent and efficient decomposition method for the traffic assignment problemThe price of optimum in Stackelberg games on arbitrary single commodity networks and latency functionsThe price of anarchy in nonatomic consumption-relevance congestion gamesA unified convergence framework for nonmonotone inexact decomposition methodsEdge pricing of multicommodity networks for selfish users with elastic demandsModels of Non-atomic Congestion Games – From Unicast to Multicast RoutingUnloading of congestion in deterministic queueing networksThe analysis of Braess' paradox and robustness based on dynamic traffic assignment modelsEfficiency and fairness of system-optimal routing with user constraintsOptimal charging facility location and capacity for electric vehicles considering route choice and charging time equilibriumEquilibrium programming:The path following approach and dynamicsA multiclass, multicriteria traffic network equilibrium modelA supply chain network game theory model with product differentiation, outsourcing of production and distribution, and quality and price competitionOptimal control of store-and-forward networksPharmaceutical supply chain networks with outsourcing under price and quality competitionTeleshopping versus shopping: A multicriteria network equilibrium frameworkMassively parallel implementation of the splitting equilibration algorithmMulticriteria network equilibrium modeling with variable weights for decision-making in the Information Age with applications to telecommuting and teleshoppingA Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel TimesA unified description of iterative algorithms for traffic equilibriaThe existence of equivalent mathematical programs for certain mixed equilibrium traffic assignment problemsA variational inequality formulation of the dynamic traffic assignment problemSpatial market equilibrium problems as network modelsManagement of knowledge intensive systems as supernetworks: modeling, analysis, computations, and applications







This page was built for publication: Traffic assignment problem for a general network