Traffic assignment problem for a general network
From MaRDI portal
Cited in
(only showing first 100 items - show all)- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
- Edge pricing of multicommodity networks for selfish users with elastic demands
- Spatial market equilibrium problems as network models
- An algorithm for the classical spatial price equilibrium problem
- A general dynamic spatial price equilibrium model: Formulation, solution, and computational results
- Human migration networks
- On the continuous quadratic knapsack problem
- Algorithms for quadratic constrained matrix problems
- Massively parallel implementation of the splitting equilibration algorithm
- A unified description of iterative algorithms for traffic equilibria
- The existence of equivalent mathematical programs for certain mixed equilibrium traffic assignment problems
- A variational inequality formulation of the dynamic traffic assignment problem
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
- Formulation, stability, and computation of traffic network equilibria as projected dynamical systems
- The convergence of equilibrium algorithms with non-monotone line search technique.
- A multiclass, multicriteria traffic network equilibrium model
- Teleshopping versus shopping: A multicriteria network equilibrium framework
- Multicriteria network equilibrium modeling with variable weights for decision-making in the Information Age with applications to telecommuting and teleshopping
- A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand
- Toll caps in privatized road networks
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Dynamic traffic assignment: Considerations on some deterministic modelling approaches
- Bilevel programming in traffic planning: Models, methods and challenge
- Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem
- Refugee migration networks and regulations: a multiclass, multipath variational inequality framework
- A traffic congestion analysis by user equilibrium and system optimum with incomplete information
- Column generation for the equilibrium route-flow traffic assignment problem
- A unified convergence framework for nonmonotone inexact decomposition methods
- The analysis of Braess' paradox and robustness based on dynamic traffic assignment models
- Optimal charging facility location and capacity for electric vehicles considering route choice and charging time equilibrium
- A supply chain network game theory model with product differentiation, outsourcing of production and distribution, and quality and price competition
- Capacitated refueling station location problem with traffic deviations over multiple time periods
- An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints
- An enhanced dynamic user optimal passenger flow assignment model for metro networks
- Selective bi-coordinate method for limit non-smooth resource allocation type problems
- Demand allocation with latency cost functions
- A survey on the continuous nonlinear resource allocation problem
- The price of anarchy in an exponential multi-server
- A path-based double projection method for solving the asymmetric traffic network equilibrium problem
- The toll effect on price of anarchy when costs are nonlinear and asymmetric
- A network equilibrium framework for internet advertising: models, qualitative analysis, and algorithms
- A unified network performance measure with importance identification and the ranking of network components
- Financial networks with intermediation and transportation network equilibria: A supernetwork equivalence and reinterpretation of the equilibrium conditions with computations
- The internet, evolutionary variational inequalities, and the time-dependent Braess paradox
- A network efficiency measure with application to critical infrastructure networks
- A heuristic algorithm for network equilibration
- How much can taxes help selfish routing?
- On the severity of Braess's paradox: designing networks for selfish users is hard
- A convergent and efficient decomposition method for the traffic assignment problem
- Forecasting travel on congested urban transportation networks: Review and prospects for network equilibrium models
- Hub location problems with price sensitive demands
- The price of anarchy in nonatomic consumption-relevance congestion games
- Pharmaceutical supply chain networks with outsourcing under price and quality competition
- A mean-risk model for the traffic assignment problem with stochastic travel times
- Decentralized optimization of last-mile delivery services with non-cooperative bounded rational customers
- A maximum entropy fixed-point route choice model for route correlation
- A comparison of dynamic user optimal states with zero, fixed and variable tolerances
- Advances in dynamic traffic assignment: TAC. A new relationship between Wardrop's user equilibrium and Nash equilibrium
- Braess's Paradox in large random graphs
- Price competition with elastic traffic
- A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
- Efficiency and fairness of system-optimal routing with user constraints
- Multi-product supply chain horizontal network integration: models, theory, and computational results
- A relative total cost index for the evaluation of transportation network robustness in the presence of degradable links and alternative travel behavior
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow
- Models of Non-atomic Congestion Games – From Unicast to Multicast Routing
- On the relationship between Nash—Cournot and Wardrop equilibria
- Unloading of congestion in deterministic queueing networks
- Equilibrium programming:The path following approach and dynamics
- Optimal control of store-and-forward networks
- Equilibria on a Congested Transportation Network
- Multiperiod competitive supply chain networks with inventorying and a transportation network equilibrium reformulation
- Retarded weighted quasi-variational inequalities for traffic equilibrium problems
- A network model and algorithm for the analysis and estimation of financial flow of funds
- Pricing with markups in industries with increasing marginal costs
- An algorithm for nonlinear multicommodity flow problems
- scientific article; zbMATH DE number 1286268 (Why is no real title available?)
- Dynamics of international financial networks with risk management
- A convergent and fast path equilibration algorithm for the traffic assignment problem
- Financial networks with electronic transactions: modelling, analysis and computations
- Selfish splittable flows and NP-completeness
- Solving multi-objective traffic assignment
- Fragile networks: identifying vulnerabilities and synergies in an uncertain age
- The dynamic distance potential field in a situation with asymmetric bottleneck capacities
- Selfishness need not be bad
- Network investment games with Wardrop followers
- The Value of Information in Selfish Routing
- Price of Anarchy in Networks with Heterogeneous Latency Functions
- Traffic assignment: on the interplay between optimization and equilibrium problems
- Evolutionary game theory
- Competitive routing in multicast communications
- Extending the notion of rationality of selfish agents: second order Nash equilibria
- Stackelberg strategies and collusion in network games with splittable flow
- Nonadaptive Selfish Routing with Online Demands
- Sensitivity of Wardrop Equilibria
- The price of anarchy is independent of the network topology
- Potential games with continuous player sets
- Formulation and analysis of horizontal mergers among oligopolistic firms with insights into the merger paradox: A supply chain network perspective
- A convergence analysis of the price of anarchy in atomic congestion games
- Braess' paradox: A cooperative game‐theoretic point of view
This page was built for publication: Traffic assignment problem for a general network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5595976)