Pages that link to "Item:Q2515069"

The following pages link to A convergent and efficient decomposition method for the traffic assignment problem (Q2515069):

Displaying 22 items.

• A mixed integer programming formulation and solution for traffic analysis zone delineation considering zone amount decision (Q507628) (← links)
• A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network (Q1367872) (← links)
• A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand (Q1634068) (← links)
• A decomposable self-adaptive projection-based prediction-correction algorithm for convex time space network flow problem (Q1644557) (← links)
• Column generation for the equilibrium route-flow traffic assignment problem (Q2163843) (← links)
• A unified convergence framework for nonmonotone inexact decomposition methods (Q2301131) (← links)
• On the convergence of inexact block coordinate descent methods for constrained optimization (Q2356093) (← links)
• Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly (Q2371467) (← links)
• Issues in the implementation of the DSD algorithm for the traffic assignment problem (Q2433525) (← links)
• A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem (Q2691902) (← links)
• Numerical stability of path-based algorithms for traffic assignment (Q2811480) (← links)
• Decomposition techniques for the minimum toll revenue problem (Q3156828) (← links)
• (Q3571172) (← links)
• (Q3609145) (← links)
• Decomposition of Path Choice Entropy in General Transport Networks (Q4233779) (← links)
• A dual scheme for traffic assignment problems (Q4375434) (← links)
• A convergent and fast path equilibration algorithm for the traffic assignment problem (Q4638926) (← links)
• Traffic Optimization Under Route Constraints with Lagrangian Relaxation and Cutting Plane Methods (Q5391732) (← links)
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5713884) (← links)
• Braess' paradox: A cooperative game‐theoretic point of view (Q6065828) (← links)
• Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network (Q6078430) (← links)
• A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem (Q6164562) (← links)