Pages that link to "Item:Q1368475"

The following pages link to The pickup and delivery problem: Faces and branch-and-cut algorithm (Q1368475):

Displaying 30 items.

• A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases (Q420868) (← links)
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← 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)
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088) (← links)
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← links)
• The stop number minimization problem: complexity and polyhedral analysis (Q1661860) (← links)
• The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438) (← links)
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment (Q1761180) (← links)
• Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792) (← 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)
• Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results (Q2343997) (← links)
• Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints (Q2455613) (← links)
• Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. II: The solution algorithm (Q2485348) (← links)
• A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (Q2514736) (← links)
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
• Interrelated trips in the rural dial-a-ride problem with autonomous vehicles (Q2673572) (← links)
• The dial-a-ride problem with private fleet and common carrier (Q2676338) (← links)
• Tree based models and algorithms for the preemptive asymmetric stacker crane problem (Q2907956) (← links)
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (Q3057131) (← links)
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
• EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM (Q3580197) (← links)
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (Q5295484) (← 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)
• A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs (Q6064162) (← links)
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (Q6160334) (← links)