Pages that link to "Item:Q2783836"

The following pages link to 2-path cuts for the vehicle routing problem with time windows (Q2783836):

Displaying 50 items.

• The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (Q296774) (← links)
• The discrete time window assignment vehicle routing problem (Q319363) (← links)
• A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← links)
• Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
• Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
• Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
• Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
• Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework (Q363544) (← links)
• Modeling and solving profitable location and distribution problems (Q375987) (← links)
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
• A column generation algorithm for the vehicle routing problem with soft time windows (Q538287) (← links)
• A tutorial on column generation and branch-and-price for vehicle routing problems (Q633483) (← links)
• Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
• On compact formulations for integer programs solved by column generation (Q817199) (← links)
• Arcs-states models for the vehicle routing problem with time windows and related problems (Q856684) (← links)
• A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows (Q858260) (← links)
• A column generation approach to the heterogeneous fleet vehicle routing problem (Q868147) (← links)
• A general heuristic for vehicle routing problems (Q869003) (← links)
• Solving a school bus scheduling problem with integer programming (Q954937) (← links)
• A dual ascent procedure for the set partitioning problem (Q955334) (← links)
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach (Q958447) (← links)
• Approximative solutions to the bicriterion vehicle routing problem with time windows (Q1038402) (← links)
• The pickup and delivery problem with time windows and handling operations (Q1652028) (← links)
• A branch-and-cut algorithm for the time window assignment vehicle routing problem (Q1652456) (← links)
• The robust vehicle routing problem with time windows: solution by branch and price and cut (Q1719626) (← links)
• Limited memory rank-1 cuts for vehicle routing problems (Q1728212) (← links)
• Branch-and-price approaches for the multiperiod technician routing and scheduling problem (Q1752769) (← links)
• Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster (Q1753599) (← links)
• Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times (Q1754111) (← links)
• Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems (Q1754114) (← links)
• An improved LNS algorithm for real-time vehicle routing problem with time windows (Q1761960) (← links)
• Vehicle routing under time-dependent travel times: the impact of congestion avoidance (Q1762059) (← links)
• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
• Vehicle routing problem with time windows and a limited number of vehicles. (Q1812003) (← links)
• A multi-start local search algorithm for the vehicle routing problem with time windows (Q1887956) (← links)
• A personalized walking bus service requiring optimized route decisions: a real case (Q2029258) (← links)
• A vehicle routing problem with distribution uncertainty in deadlines (Q2030574) (← links)
• Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (Q2147168) (← links)
• Feeder routing for air-to-air refueling operations (Q2171624) (← links)
• Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (Q2174903) (← links)
• Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
• Branch and price for the vehicle routing problem with discrete Split deliveries and time windows (Q2275800) (← links)
• Bidirectional labeling for solving vehicle routing and truck driver scheduling problems (Q2286924) (← links)
• Research on the vehicle routing problem with interval demands (Q2295076) (← links)
• Algorithms for non-linear and stochastic resource constrained shortest path (Q2417959) (← links)
• Reachability cuts for the vehicle routing problem with time windows (Q2432846) (← links)
• Combined location and routing problems for drug distribution (Q2448896) (← links)
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) (← links)
• New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)