Pages that link to "Item:Q847836"

The following pages link to The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836):

Displaying 44 items.

• A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
• Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) (← links)
• Routing problems with loading constraints (Q610992) (← links)
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery (Q705506) (← links)
• A branch-and-cut algorithm for factory crane scheduling problem (Q897052) (← links)
• Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search (Q926338) (← links)
• Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete (Q967292) (← links)
• The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
• A new formulation for the traveling deliveryman problem (Q1003469) (← links)
• The double traveling salesman problem with multiple stacks: A variable neighborhood search approach (Q1025245) (← links)
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← links)
• An algorithm for the traveling salesman problem with pickup and delivery customers (Q1071656) (← links)
• Heuristics for the traveling salesman problem with pickup and delivery (Q1302721) (← links)
• The travelling salesman problem with pick-up and delivery (Q1342068) (← links)
• The two-period travelling salesman problem applied to milk collection in Ireland (Q1356071) (← links)
• The pickup and delivery problem: Faces and branch-and-cut algorithm (Q1368475) (← links)
• Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
• A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016) (← links)
• Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks (Q1652571) (← links)
• An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem (Q1661892) (← links)
• The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438) (← links)
• An ILP-based local search procedure for the VRP with pickups and deliveries (Q1698289) (← links)
• Dynamic courier routing for a food delivery service (Q1738833) (← 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)
• A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q2242245) (← links)
• Decision diagrams for solving traveling salesman problems with pickup and delivery in real time (Q2294298) (← links)
• Pickup and delivery problem with incompatibility constraints (Q2333153) (← links)
• A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
• A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (Q2514736) (← links)
• New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2968488) (← links)
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (Q3057131) (← links)
• An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP (Q3386761) (← links)
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
• An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections (Q4422622) (← links)
• The traveling salesman problem with pickup, delivery, and ride-time constraints (Q4642421) (← links)
• A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q5326770) (← links)
• FORMALIZATION OF PICKUP AND DELIVERY PROBLEM (Q5374531) (← links)
• Solving the traveling salesperson problem with precedence constraints by deep reinforcement learning (Q6041315) (← links)
• A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs (Q6064162) (← links)