Publication | Closed Access

A branch-and-cut algorithm for a realistic dial-a-ride problem

Mathematical ProgrammingRealistic Dial-a-ride ProblemRoute ChoiceEngineeringRoute PlanningComputer ScienceVehicle Routing ProblemDiscrete MathematicsCombinatorial OptimizationInteger ProgrammingOperations Research