Pages that link to "Item:Q705506"

The following pages link to A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery (Q705506):

Displaying 50 items.

• The static bicycle relocation problem with demand intervals (Q296779) (← links)
• An exact algorithm for the static rebalancing problem arising in bicycle sharing systems (Q319656) (← 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)
• A destroy and repair algorithm for the bike sharing rebalancing problem (Q342356) (← links)
• A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (Q602676) (← links)
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
• PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems (Q887207) (← links)
• A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510) (← links)
• On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands (Q1013973) (← links)
• Single-commodity vehicle routing problem with pickup and delivery service (Q1023173) (← 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)
• An algorithm for the traveling salesman problem with pickup and delivery customers (Q1071656) (← links)
• Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer (Q1634057) (← links)
• An adaptive large neighborhood search for relocating vehicles in electric carsharing services (Q1634774) (← links)
• A heuristic algorithm for a single vehicle static bike sharing rebalancing problem (Q1652142) (← links)
• Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698) (← links)
• An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem (Q1661892) (← links)
• An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation (Q1695028) (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
• Inventory routing with pickups and deliveries (Q1754327) (← links)
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
• The single-vehicle two-echelon one-commodity pickup and delivery problem (Q2027019) (← links)
• Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792) (← links)
• Circular Jaccard distance based multi-solution optimization for traveling salesman problems (Q2086823) (← links)
• A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q2242245) (← links)
• A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries (Q2286875) (← links)
• A truck scheduling problem arising in intermodal container transportation (Q2356036) (← links)
• Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery (Q2356181) (← links)
• An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot (Q2357926) (← links)
• A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
• Bike sharing systems: solving the static rebalancing problem (Q2445841) (← links)
• Single vehicle routing with a predefined customer sequence and multiple depot returns (Q2463499) (← links)
• A new VRPPD model and a hybrid heuristic solution approach for e-tailing (Q2514740) (← links)
• Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) (← links)
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
• A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem (Q2675709) (← links)
• The multi-commodity pickup-and-delivery traveling salesman problem (Q2811323) (← links)
• A branch-and-cut algorithm for the preemptive swapping problem (Q2913951) (← links)
• An exact method for the double TSP with multiple stacks (Q3002549) (← links)
• Balancing the stations of a self service “bike hire” system (Q3016180) (← links)
• One-to-Many-to-One Single Vehicle Pickup and Delivery Problems (Q3564364) (← links)
• An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections (Q4422622) (← links)
• Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems (Q5058035) (← links)
• A branch‐and‐cut algorithm for the nonpreemptive swapping problem (Q5187945) (← links)
• Green split multiple-commodity pickup and delivery vehicle routing problem (Q6047862) (← links)
• A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs (Q6064162) (← links)
• A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem (Q6065616) (← links)
• Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149) (← links)