Publication | Closed Access

A compact model and tight bounds for a combined location-routing problem

Mathematical ProgrammingTight BoundsNetwork Routing AlgorithmCompact ModelEngineeringRoute PlanningNetwork RoutingCombined Location-routing ProblemNetwork AnalysisLogisticsEducationRobust RoutingVehicle Routing ProblemDiscrete MathematicsCombinatorial OptimizationOperations Research