Pages that link to "Item:Q1044088"

The following pages link to The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088):

Displaying 13 items.

• A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations (Q320708) (← links)
• Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures (Q336468) (← links)
• The dial-A-ride problem with transfers (Q336745) (← links)
• An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines (Q342360) (← links)
• A post-improvement procedure for the mixed load school bus routing problem (Q439357) (← links)
• A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources (Q716354) (← links)
• The school bus routing problem: a review (Q1039772) (← links)
• Vehicle routing with cross-dock selection (Q1652043) (← links)
• A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking (Q1652321) (← links)
• Typology and literature review for dial-a-ride problems (Q1698288) (← links)
• Moving products between location pairs: cross-docking versus direct-shipping (Q1752263) (← links)
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment (Q1761180) (← links)
• A comparison of two meta-heuristics for the pickup and delivery problem with transshipment (Q1782171) (← links)