Optimum departure times for commuters in congested networks

DOI10.1007/BF02283700zbMath0724.90076OpenAlexW1978586831MaRDI QIDQ2277160

André de Palma, Pierre Hansen

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02283700

zbMATH Keywords

NP-hardone-sided Lipschitz functioncongested networkgeneralized shortest path algorithmoptimum departure time

Mathematics Subject Classification ID

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

Related Items

Global optimization of univariate Lipschitz functions. I: Survey and properties

Cites Work

• Global optimization of univariate Lipschitz functions. I: Survey and properties
• Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
• Min-max heaps and generalized priority queues
• An algorithm for finding the absolute extremum of a function
• Commuters' Paths with Penalties for Early or Late Arrival Time
• A Sequential Method Seeking the Global Maximum of a Function