Pages that link to "Item:Q3392186"

The following pages link to Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows (Q3392186):

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)
• Two exact algorithms for the traveling umpire problem (Q319246) (← links)
• The discrete time window assignment vehicle routing problem (Q319363) (← links)
• A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times (Q320872) (← links)
• Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
• Integer programming formulations for the elementary shortest path problem (Q322844) (← 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)
• Single liner shipping service design (Q336948) (← links)
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
• Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
• A new formulation and approach for the black and white traveling salesman problem (Q337265) (← links)
• A branch-price-and-cut algorithm for the workover rig routing problem (Q339692) (← links)
• A branch and price approach for deployment of multi-tier software services in clouds (Q342499) (← 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)
• Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem (Q375997) (← 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)
• Multi-objective and multi-constrained non-additive shortest path problems (Q609807) (← 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)
• An exact solution framework for a broad class of vehicle routing problems (Q993700) (← links)
• Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem (Q1038381) (← links)
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows (Q1040973) (← links)
• A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
• Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (Q1651704) (← links)
• The pickup and delivery problem with time windows and handling operations (Q1652028) (← links)
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
• Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows (Q1652285) (← links)
• Robust vehicle routing problem with hard time windows under demand and travel time uncertainty (Q1652619) (← 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)
• A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design (Q1744533) (← links)
• Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster (Q1753599) (← links)
• Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems (Q1754114) (← links)
• Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
• Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
• Air cargo scheduling: integrated models and solution procedures (Q1944877) (← links)
• Minimum makespan vehicle routing problem with compatibility constraints (Q2011596) (← links)
• Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning (Q2028802) (← links)
• Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes (Q2031089) (← links)
• Solving bin packing problems using VRPSolver models (Q2033390) (← links)
• Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
• The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← links)
• Branch-and-cut-and-price for multi-agent path finding (Q2147092) (← links)
• Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (Q2147168) (← links)
• Exact algorithms to minimize makespan on single and parallel batch processing machines (Q2183850) (← links)
• On the exact solution of vehicle routing problems with backhauls (Q2189917) (← links)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)