Pages that link to "Item:Q1071656"
From MaRDI portal
The following pages link to An algorithm for the traveling salesman problem with pickup and delivery customers (Q1071656):
Displayed 17 items.
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
- Self-organizing feature maps for the vehicle routing problem with backhauls (Q880535) (← links)
- The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches (Q1027598) (← links)
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← links)
- A heuristic for the pickup and delivery traveling salesman problem (Q1571039) (← links)
- Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
- The traveling salesman problem with backhauls (Q1915968) (← links)
- Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints (Q2455613) (← links)
- Heuristic approaches to vehicle routing with backhauls and time windows (Q2564754) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (Q3057131) (← links)
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
- EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM (Q3580197) (← links)
- Better assignment lower bounds for the Euclidean traveling salesman problem (Q3771999) (← links)
- AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING (Q5315981) (← links)