Pages that link to "Item:Q5595976"
From MaRDI portal
The following pages link to Traffic assignment problem for a general network (Q5595976):
Displayed 50 items.
- Management of knowledge intensive systems as supernetworks: modeling, analysis, computations, and applications (Q815353) (← links)
- Financial networks with intermediation: risk management with variable weights (Q818078) (← links)
- The 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 levels (Q853593) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- A network model of migration equilibrium with movement costs (Q919979) (← links)
- A new model for selfish routing (Q952441) (← links)
- Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions (Q1006047) (← links)
- Edge pricing of multicommodity networks for selfish users with elastic demands (Q1014793) (← links)
- Spatial market equilibrium problems as network models (Q1072912) (← links)
- An algorithm for the classical spatial price equilibrium problem (Q1088874) (← links)
- A general dynamic spatial price equilibrium model: Formulation, solution, and computational results (Q1109664) (← links)
- Human migration networks (Q1194762) (← links)
- On the continuous quadratic knapsack problem (Q1194858) (← links)
- Algorithms for quadratic constrained matrix problems (Q1200862) (← links)
- Massively parallel implementation of the splitting equilibration algorithm (Q1316420) (← links)
- A unified description of iterative algorithms for traffic equilibria (Q1322143) (← links)
- The existence of equivalent mathematical programs for certain mixed equilibrium traffic assignment problems (Q1322145) (← links)
- A variational inequality formulation of the dynamic traffic assignment problem (Q1322146) (← links)
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods (Q1338143) (← links)
- Formulation, stability, and computation of traffic network equilibria as projected dynamical systems (Q1379961) (← links)
- The convergence of equilibrium algorithms with non-monotone line search technique. (Q1415258) (← links)
- A multiclass, multicriteria traffic network equilibrium model (Q1585821) (← links)
- Teleshopping versus shopping: A multicriteria network equilibrium framework (Q1600504) (← links)
- Multicriteria network equilibrium modeling with variable weights for decision-making in the Information Age with applications to telecommuting and teleshopping (Q1605215) (← links)
- Bounding the inefficiency of equilibria in nonatomic congestion games (Q1885439) (← links)
- Dynamic traffic assignment: Considerations on some deterministic modelling approaches (Q1908277) (← links)
- Bilevel programming in traffic planning: Models, methods and challenge (Q1913607) (← links)
- An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints (Q2383757) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- The price of anarchy in an exponential multi-server (Q2457255) (← links)
- A path-based double projection method for solving the asymmetric traffic network equilibrium problem (Q2458917) (← links)
- The toll effect on price of anarchy when costs are nonlinear and asymmetric (Q2462125) (← links)
- A network equilibrium framework for internet advertising: models, qualitative analysis, and algorithms (Q2463496) (← links)
- A unified network performance measure with importance identification and the ranking of network components (Q2465572) (← links)
- Financial networks with intermediation and transportation network equilibria: A supernetwork equivalence and reinterpretation of the equilibrium conditions with computations (Q2468330) (← links)
- The internet, evolutionary variational inequalities, and the time-dependent Braess paradox (Q2468772) (← links)
- A network efficiency measure with application to critical infrastructure networks (Q2481096) (← links)
- A heuristic algorithm for network equilibration (Q2490221) (← links)
- How much can taxes help selfish routing? (Q2495395) (← links)
- On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322) (← links)
- Forecasting travel on congested urban transportation networks: Review and prospects for network equilibrium models (Q2642505) (← links)
- Efficiency and fairness of system-optimal routing with user constraints (Q3418209) (← links)
- A relative total cost index for the evaluation of transportation network robustness in the presence of degradable links and alternative travel behavior (Q3601203) (← links)
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow (Q3602835) (← links)
- Models of Non-atomic Congestion Games – From Unicast to Multicast Routing (Q3637323) (← links)
- On the relationship between Nash—Cournot and Wardrop equilibria (Q3703616) (← links)
- Unloading of congestion in deterministic queueing networks (Q3907384) (← links)
- Equilibrium programming:The path following approach and dynamics (Q3932605) (← links)
- Optimal control of store-and-forward networks (Q3944435) (← links)