Commuters' Paths with Penalties for Early or Late Arrival Time

DOI10.1287/trsc.24.4.276zbMath0724.90075OpenAlexW2131688523MaRDI QIDQ5202523

Martine Labbé, Pierre Hansen, André de Palma

Publication date: 1990

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: http://www.kellogg.northwestern.edu/research/math/papers/727.pdf

zbMATH Keywords

NP-hardpseudo- polynomial algorithmgeneralized shortest path problempolynomial subcases

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

Optimum departure times for commuters in congested networks ⋮ A variational inequality formulation of the dynamic traffic assignment problem ⋮ Vehicle dispatching with time-dependent travel times

This page was built for publication: Commuters' Paths with Penalties for Early or Late Arrival Time