Pages that link to "Item:Q1728253"

The following pages link to Pickup and delivery problem with time windows: a new compact two-index formulation (Q1728253):

Displaying 17 items.

• A decomposition approach for commodity pickup and delivery with time-windows under uncertainty (Q490359) (← links)
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles (Q1999625) (← links)
• Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792) (← links)
• Event-based MILP models for ridepooling applications (Q2140290) (← links)
• Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121) (← links)
• A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (Q2208364) (← links)
• Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: the pollution routing game (Q2424787) (← links)
• A study on the pickup and delivery problem with time windows: matheuristics and new instances (Q2664415) (← links)
• A scalable anticipatory policy for the dynamic pickup and delivery problem (Q2676347) (← links)
• FORMALIZATION OF PICKUP AND DELIVERY PROBLEM (Q5374531) (← links)
• Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery (Q6047877) (← links)
• A mixed rebalancing strategy in bike sharing systems (Q6048177) (← links)
• Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed (Q6048503) (← links)
• Solving a pickup and delivery routing problem for fourth‐party logistics providers (Q6195030) (← links)
• Flexible vehicle scheduling with precedence constraints for tourists (Q6195032) (← links)
• Model formulations for pickup and delivery problems in designated driver services (Q6551155) (← links)
• A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery (Q6659827) (← links)