scientific article; zbMATH DE number 1488064

MaRDI QIDQ4495161zbMATHFDO

Authors Sang Nguyen, P. Marcotte

Publication date 21 November 2001

zbMATH Keywords

shortest hyperpathscapacitated networks

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Discrete location and assignment (90B80)

Recommendations

• A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks
• Stochastic assignment to high frequency transit networks: Models, algorithms, and applications with different perceived cost distributions
• Equilibrium traffic assignment for large scale transit networks
• Transit Equilibrium Assignment: A Model and Solution Algorithms

Cited in

(13)

• Origin-Based Algorithm for the Traffic Assignment Problem
• User equilibrium with recourse
• Stochastic assignment to high frequency transit networks: Models, algorithms, and applications with different perceived cost distributions
• Traffic Optimization Under Route Constraints with Lagrangian Relaxation and Cutting Plane Methods
• Pareto-optimal sustainable transportation network design under spatial queuing
• Reliability in public transit networks considering backup itineraries
• A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks
• Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Directed hypergraphs: introduction and fundamental algorithms -- a survey
• Linear programming formulation for strategic dynamic traffic assignment
• Route choice modeling with overlapping in super-networks
• Non-additive shortest path in the context of traffic assignment

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4495161)