Pages that link to "Item:Q342036"
From MaRDI portal
The following pages link to Load-dependent and precedence-based models for pickup and delivery problems (Q342036):
Displaying 25 items.
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
- Models for the single-vehicle preemptive pickup and delivery problem (Q421257) (← links)
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem (Q1628071) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem (Q1651640) (← links)
- An improved ant colony system for the sequential ordering problem (Q1652370) (← links)
- An exact decomposition method to save trips in cooperative pickup and delivery based on scheduled trips and profit distribution (Q1652425) (← links)
- Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698) (← links)
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
- The multi-pickup and delivery problem with time windows (Q1744529) (← links)
- Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
- Branch-and-bound for the precedence constrained generalized traveling salesman problem (Q1984690) (← links)
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
- Perspectives on integer programming for time-dependent models (Q2001858) (← links)
- New mixed integer-programming model for the pickup-and-delivery problem with transshipment (Q2256318) (← links)
- Extension and Application of a General Pickup and Delivery Model for Evaluating the Impact of Bundling Goods in an Urban Environment (Q2806899) (← links)
- The multi-commodity pickup-and-delivery traveling salesman problem (Q2811323) (← links)
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP (Q3386761) (← links)
- Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries (Q3652242) (← links)
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
- Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
- Model formulations for pickup and delivery problems in designated driver services (Q6551155) (← links)
- Layered graph models for the electric vehicle routing problem with nonlinear charging functions (Q6663970) (← links)
