Pages that link to "Item:Q1041945"
From MaRDI portal
The following pages link to The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945):
Displaying 22 items.
- Notes on the single route lateral transhipment problem (Q276506) (← links)
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (Q322620) (← links)
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
- Single liner shipping service design (Q336948) (← links)
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases (Q420868) (← links)
- A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (Q602676) (← links)
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows (Q617511) (← links)
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem (Q1628071) (← links)
- Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698) (← links)
- An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation (Q1695028) (← links)
- An ILP-based local search procedure for the VRP with pickups and deliveries (Q1698289) (← links)
- The multi-pickup and delivery problem with time windows (Q1744529) (← links)
- Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem (Q1751783) (← links)
- The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
- Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery (Q2514738) (← links)
- The multi-commodity pickup-and-delivery traveling salesman problem (Q2811323) (← links)
- Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem (Q2907956) (← links)
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP (Q3386761) (← links)
- The drone-assisted pickup and delivery problem: an adaptive large neighborhood search metaheuristic (Q6065628) (← links)