Pages that link to "Item:Q633483"

The following pages link to A tutorial on column generation and branch-and-price for vehicle routing problems (Q633483):

Displaying 32 items.

• Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows (Q320995) (← links)
• A branch-and-price algorithm for stable workforce assignments with hierarchical skills (Q322747) (← links)
• Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
• A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration (Q483728) (← links)
• Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
• Solving the petroleum replenishment and routing problem with variable demands and time windows (Q827236) (← links)
• Empirical analysis for the VRPTW with a multigraph representation for the road network (Q1651529) (← links)
• Accelerating the branch-and-price algorithm using machine learning (Q1653391) (← links)
• The robust vehicle routing problem with time windows: solution by branch and price and cut (Q1719626) (← links)
• Branch-and-price approaches for the multiperiod technician routing and scheduling problem (Q1752769) (← links)
• A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
• A way to optimally solve a green time-dependent vehicle routing problem with time windows (Q1993575) (← links)
• Minimum makespan vehicle routing problem with compatibility constraints (Q2011596) (← links)
• Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
• Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
• The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
• An efficient and general approach for the joint order batching and picker routing problem (Q2183853) (← links)
• The time-dependent vehicle routing problem with time windows and road-network information (Q2226499) (← links)
• A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports (Q2256282) (← links)
• A matheuristic for the truck and trailer routing problem (Q2355939) (← links)
• A heuristic for cumulative vehicle routing using column generation (Q2357169) (← links)
• Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time (Q2664351) (← links)
• The Team Orienteering Pick-Up and Delivery Problem with Time Windows and its applications in fleet sizing (Q2826662) (← links)
• Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
• Robust Team Orienteering Problem with Decreasing Profits (Q5060796) (← links)
• Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity (Q5086014) (← links)
• Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints (Q5087714) (← links)
• A relax‐and‐price heuristic for the inventory‐location‐routing problem (Q5246829) (← links)
• Configuration‐based approach for topological problems in the design of wireless sensor networks (Q6088118) (← links)
• Estimating the marginal cost to deliver to individual customers (Q6088526) (← links)
• Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows (Q6092647) (← links)
• The multi-trip container drayage problem with synchronization for efficient empty containers re-usage (Q6113336) (← links)