Pages that link to "Item:Q2276884"

The following pages link to Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints (Q2276884):

Displaying 50 items.

• A smoothing approach for solving transportation problem with road toll pricing and capacity expansions (Q260202) (← links)
• Sensitivity analysis of user equilibrium flows revisited (Q264294) (← links)
• Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints (Q336802) (← links)
• Optimization of robust area traffic control with equilibrium flow under demand uncertainty (Q336835) (← links)
• An interior point technique for solving bilevel programming problems (Q402214) (← links)
• Optimal design of signal controlled road networks using differential evolution optimization algorithm (Q473997) (← links)
• An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities (Q494664) (← links)
• Optimization-simulation model for planning supply transport to large infrastructure public works located in congested urban areas (Q613546) (← links)
• A novel algorithm for area traffic capacity control with elastic travel demands (Q622897) (← links)
• A smoothing Newton method for mathematical programs constrained by parameterized quasi-variational inequalities (Q657283) (← links)
• Generalized variational inequalities with fuzzy relation (Q697545) (← links)
• A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints (Q697548) (← links)
• Maximizing network throughput under stochastic user equilibrium with elastic demand (Q724322) (← links)
• Optimal signal-setting for road network with maximum capacity (Q726403) (← links)
• Optimality conditions for multiobjective optimization problem constrained by parameterized variational inequalities (Q742188) (← links)
• A subgradient optimization model for continuous road network design problem (Q840176) (← links)
• Approximation of the steepest descent direction for the O-D matrix adjustment problem (Q867565) (← links)
• An efficient search algorithm for road network optimization (Q945224) (← links)
• A dimension-reduced method of sensitivity analysis for stochastic user equilibrium assignment model (Q967808) (← links)
• A descent framework for linked signal system with network flows (Q990692) (← links)
• Optimization of limited network capacity with toll settings (Q1007852) (← links)
• A non-smooth model for signalized road network design problems (Q1031591) (← links)
• Hierarchical optimization: An introduction (Q1184516) (← links)
• Uniqueness results and algorithm for Stackelberg-Cournot-Nash equilibria (Q1184518) (← links)
• Heuristic algorithms for delivered price spatially competitive network facility location problems (Q1184531) (← links)
• Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review (Q1184534) (← links)
• Bilevel and multilevel programming: A bibliography review (Q1338535) (← links)
• Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions. (Q1427572) (← links)
• Optimal prestress of cracked unilateral structures: Finite element analysis of an optimal control problem for variational inequalities. (Q1578637) (← links)
• A new descent algorithm for solving quadratic bilevel programming problems. (Q1582569) (← links)
• Global optimization for transport network expansion and signal setting (Q1665561) (← links)
• An interior point method for nonlinear optimization with a quasi-tangential subproblem (Q1689438) (← links)
• Exploring the impact of commuter's residential location choice on the design of a rail transit line based on prospect theory (Q1718617) (← links)
• Estimating the capacity of urban transportation networks with an improved sensitivity based method (Q1723533) (← links)
• A variational inequality framework for network games: existence, uniqueness, convergence and sensitivity analysis (Q1735796) (← links)
• Bilevel road pricing: theoretical analysis and optimality conditions (Q1761815) (← links)
• Joint optimization for area traffic control and network flow (Q1781555) (← links)
• A numerical approach to optimization problems with variational inequality constraints (Q1804370) (← links)
• Exact and inexact penalty methods for the generalized bilevel programming problem (Q1814788) (← links)
• An entropic regularization approach for mathematical programs with equilibrium constraints (Q1886001) (← links)
• Mathematical modelling of spatial price equilibrium for multicommodity consumer flows of large markets using variational inequalities (Q1893722) (← links)
• Sensitivity analysis for queuing equilibrium network flow and its application to traffic control (Q1906967) (← links)
• Bilevel programming in traffic planning: Models, methods and challenge (Q1913607) (← links)
• An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes (Q1994496) (← links)
• Solving signal control problems with second-order sensitivity information of equilibrium network flows (Q2336859) (← links)
• An efficient computation algorithm for area traffic control problem with link capacity expansions (Q2371987) (← links)
• A generalized iterative scheme for network design problem (Q2371990) (← links)
• Comparative tests of solution methods for signal-controlled road networks (Q2384530) (← links)
• New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks (Q2433515) (← links)
• A globally convergent algorithm for transportation continuous network design problem (Q2454630) (← links)