Pages that link to "Item:Q6160334"

The following pages link to An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (Q6160334):

Displayed 21 items.

• Rich vehicle routing problems: from a taxonomy to a definition (Q299767) ‎ (← links)
• The multiple vehicle pickup and delivery problem with LIFO constraints (Q319195) ‎ (← links)
• Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) ‎ (← links)
• A hybrid approach for the vehicle routing problem with three-dimensional loading constraints (Q336326) ‎ (← links)
• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) ‎ (← links)
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) ‎ (← links)
• What are the worst cases in constrained last-in-first-out pick-up and delivery problems? (Q1651694) ‎ (← links)
• Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks (Q1652571) ‎ (← links)
• Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading (Q1652699) ‎ (← links)
• Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system (Q1751731) ‎ (← links)
• Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem (Q1751783) ‎ (← links)
• The pickup and delivery traveling salesman problem with handling costs (Q1752776) ‎ (← links)
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) ‎ (← links)
• Vehicle routing problems with loading constraints: state-of-the-art and future directions (Q2018104) ‎ (← links)
• The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) ‎ (← links)
• Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results (Q2343997) ‎ (← links)
• Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2670579) ‎ (← links)
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) ‎ (← links)
• A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs (Q6064162) ‎ (← links)
• The double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6071059) ‎ (← links)
• A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6080619) ‎ (← links)