Visiting a network of services with time constraints.

DOI10.1016/S0305-0548(02)00067-9zbMath1047.90005MaRDI QIDQ1413815

Monica Gentili

Publication date: 17 November 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

RoutingSchedulingShortest pathTime windows

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (3)

Delivery itineraries and distribution capacity of a freight network with time slots ⋮ Multiperiod integrated routing and scheduling of World Food Programme cargo planes in Angola ⋮ Shortest path problems with left-side time windows

Cites Work

• Routing problems: A bibliography
• Vehicle Routing with Time Windows
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• Unnamed Item

This page was built for publication: Visiting a network of services with time constraints.