Pages that link to "Item:Q2496037"

The following pages link to Lagrangian duality applied to the vehicle routing problem with time windows (Q2496037):

Displaying 28 items.

• A new mixed integer programming model for curriculum balancing: application to a Turkish university (Q296758) (← links)
• Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
• Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
• Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
• Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
• A tutorial on column generation and branch-and-price for vehicle routing problems (Q633483) (← links)
• A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows (Q853026) (← links)
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach (Q958447) (← links)
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem (Q975996) (← links)
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows (Q1040973) (← links)
• A stochastic dynamic traveling salesman problem with hard time windows (Q1042055) (← links)
• Limited memory rank-1 cuts for vehicle routing problems (Q1728212) (← links)
• A comparison of three metaheuristics for the workover rig routing problem (Q1926698) (← links)
• A vehicle routing problem with distribution uncertainty in deadlines (Q2030574) (← links)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
• A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
• Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
• A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows (Q2506187) (← links)
• An inventory-routing problem with the objective of travel time minimization (Q2514745) (← links)
• Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
• An Investigation on Compound Neighborhoods for VRPTW (Q2980168) (← links)
• A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows (Q3422371) (← links)
• New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317) (← links)
• A relax‐and‐price heuristic for the inventory‐location‐routing problem (Q5246829) (← links)
• Integrated job scheduling and network routing (Q5326793) (← links)
• New Refinements for the Solution of Vehicle Routing Problems with Branch and Price (Q6160335) (← links)