Routing with time windows by column generation

This publication has 12 references indexed in Scilit:

• Plus court chemin avec contraintes d'horaires
  Rairo-Operations Research, 1983
• A generalized assignment heuristic for vehicle routing
  Networks, 1981
• State‐space relaxation procedures for the computation of bounds to routing problems
  Networks, 1981
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
  Management Science, 1980
• Minimal Resources for Fixed and Variable Job Schedules
  Operations Research, 1978
• Scheduling with earliest start and due date constraints on multiple machines
  Naval Research Logistics Quarterly, 1975
• Scheduling and Fleet Routing Models for Transportation Systems
  Transportation Science, 1971
• Pathology of Traveling-Salesman Subtour-Elimination Algorithms
  Operations Research, 1971
• Integer Programming Formulation of Traveling Salesman Problems
  Journal of the ACM, 1960
• Minimizing the number of tankers to meet a fixed schedule
  Naval Research Logistics Quarterly, 1954