Pages that link to "Item:Q3320098"

The following pages link to Sensitivity analysis for the asymmetric network equilibrium problem (Q3320098):

Displaying 30 items.

• Multiperiod competitive supply chain networks with inventorying and a transportation network equilibrium reformulation (Q400033) (← links)
• An efficient algorithm for solving supply chain network equilibria and equivalent supernetwork based traffic network equilibria (Q546459) (← links)
• Truthful mechanisms for selfish routing and two-parameter agents (Q647482) (← links)
• Solution differentiability for oligopolistic network equilibria (Q751976) (← links)
• Benders decomposition for variational inequalities (Q757226) (← links)
• A network formulation of market equilibrium problems and variational inequalities (Q760328) (← links)
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications (Q811414) (← links)
• A link-node discrete-time dynamic second best toll pricing model with a relaxation solution algorithm (Q836010) (← links)
• Approximation of the steepest descent direction for the O-D matrix adjustment problem (Q867565) (← links)
• A survey of dynamic network flows (Q917417) (← links)
• Sensitivity of Wardrop equilibria (Q987396) (← links)
• Perturbed solutions of variational inequality problems over polyhedral sets (Q1089902) (← links)
• Sensitivity analysis of generalized variational inequalities (Q1197398) (← links)
• Approximation theory for stochastic variational and Ky Fan inequalities in finite dimensions (Q1308652) (← links)
• Partionable variational inequalities with applications to network and economic equilibria (Q1321179) (← links)
• Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions. (Q1427572) (← links)
• On the stability of projected dynamical systems (Q1893344) (← links)
• Sensitivity analysis for queuing equilibrium network flow and its application to traffic control (Q1906967) (← links)
• Lead-time quotations in unobservable make-to-order systems with strategic customers: risk aversion, load control and profit maximization (Q2028808) (← links)
• Nonatomic aggregative games with infinitely many types (Q2140304) (← links)
• Sensitivity of wardrop equilibria: revisited (Q2174917) (← links)
• Sensitivity analysis for variational inequalities and nonlinear complementarity problems (Q2276887) (← links)
• Achieving target equilibria in network routing games without knowing the latency functions (Q2278946) (← links)
• The classical Braess paradox problem revisited: a generalized inverse method on non-unique path flow cases (Q2357917) (← links)
• A globally convergent algorithm for transportation continuous network design problem (Q2454630) (← links)
• A network equilibrium framework for internet advertising: models, qualitative analysis, and algorithms (Q2463496) (← links)
• How much can taxes help selfish routing? (Q2495395) (← links)
• A heuristic for the OD matrix adjustment problem in a congested transport network (Q2630227) (← links)
• A Synergetic Reformulation of General Equilibrium Theory (Q5866459) (← links)
• The price of anarchy in routing games as a function of the demand (Q6201916) (← links)