Pages that link to "Item:Q4233778"

The following pages link to The Traffic Equilibrium Problem with Nonadditive Path Costs (Q4233778):

Displaying 33 items.

• A complementary formulation for traffic equilibrium problem with a new nonadditive route cost (Q413133) (← links)
• Solving multi-objective traffic assignment (Q490239) (← links)
• Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs (Q613225) (← links)
• A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost (Q636547) (← links)
• Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications (Q841630) (← links)
• A multiclass, multicriteria logit-based traffic equilibrium assignment model under ATIS (Q853023) (← links)
• Stochastic nonlinear complementarity problem and applications to traffic equilibrium under uncertainty (Q946176) (← links)
• An implicit programming approach for the road pricing problem with nonadditive route costs (Q999240) (← links)
• Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model (Q1027595) (← links)
• A note on the existence of traffic equilibria (Q1079476) (← links)
• The existence of equivalent mathematical programs for certain mixed equilibrium traffic assignment problems (Q1322145) (← links)
• Reformulating the traffic equilibrium problem via a smooth gap function. (Q1597124) (← links)
• A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions (Q1655357) (← links)
• Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account (Q1730667) (← links)
• Non-additive shortest path in the context of traffic assignment (Q1754328) (← links)
• A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem (Q1761957) (← links)
• Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities (Q1887951) (← links)
• Arrival time reliability in strategic user equilibrium (Q2005962) (← links)
• Finding flow equilibrium with projective methods with decomposition and route generation (Q2261748) (← links)
• Traffic modeling flows in a developing urban infrastructure with a software suite for creating interactive virtual environments (Q2397264) (← links)
• Robust solutions to box-constrained stochastic linear variational inequality problem (Q2410509) (← links)
• User equilibrium traffic network assignment with stochastic travel times and late arrival penalty (Q2433520) (← links)
• A power penalty method for the general traffic assignment problem with elastic demand (Q2438418) (← links)
• A path-based double projection method for solving the asymmetric traffic network equilibrium problem (Q2458917) (← links)
• Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size (Q2669769) (← links)
• Pricing on paths: a PTAS for the highway problem (Q2796210) (← links)
• A mean-risk model for the traffic assignment problem with stochastic travel times (Q2875605) (← links)
• On One Routing Problem with Non-Additive Cost Aggregation (Q3387303) (← links)
• Nonlinear cost network models in transportation analysis (Q3747201) (← links)
• Equilibria for Networks with Lower Semicontinuous Costs: With an Application to Congestion Pricing (Q4319312) (← links)
• A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs (Q5954824) (← links)
• Generalized Nash equilibrium models for asymmetric, non-cooperative games on line graphs: application to water resource systems (Q6109565) (← links)
• Mean‐standard deviation model for minimum cost flow problem (Q6179689) (← links)