Pages that link to "Item:Q1681438"

The following pages link to The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438):

Displaying 13 items.

• Electric vehicle routing problem with time-dependent waiting times at recharging stations (Q1738821) (← links)
• A hybrid algorithm for time-dependent vehicle routing problem with time windows (Q2027083) (← links)
• A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262) (← links)
• Multi-trip time-dependent vehicle routing problem with time windows (Q2029965) (← links)
• An assign-and-route matheuristic for the time-dependent inventory routing problem (Q2116930) (← links)
• A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs (Q2118082) (← links)
• Models and algorithms for the traveling salesman problem with time-dependent service times (Q2294625) (← links)
• Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (Q2676342) (← links)
• Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801) (← links)
• Comments on: ``Perspectives on integer programming for time-dependent models'' (Q5970689) (← links)
• A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows (Q6087498) (← links)
• Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows (Q6092647) (← links)
• Two-echelon time-dependent vehicle routing problem with simultaneous pickup and delivery and satellite synchronization (Q6568433) (← links)