Pages that link to "Item:Q4648688"

The following pages link to Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks (Q4648688):

Displaying 17 items.

• Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
• A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints (Q323423) (← links)
• Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
• An adapted heuristic approach for a clustered traveling salesman problem with loading constraints (Q693154) (← links)
• Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks (Q1652571) (← links)
• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
• Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162) (← links)
• The pickup and delivery traveling salesman problem with handling costs (Q1752776) (← links)
• Vehicle routing problems with loading constraints: state-of-the-art and future directions (Q2018104) (← links)
• The vehicle routing problem with simultaneous pickup and delivery and handling costs (Q2289929) (← links)
• Designing vehicle routes for a mix of different request types, under time windows and loading constraints (Q2355860) (← links)
• Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2670579) (← links)
• A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (Q2835682) (← links)
• New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2968488) (← links)
• A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks (Q5246822) (← links)
• A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q5326770) (← links)
• A nonlinear optimization model for the balanced vehicle routing problem with loading constraints (Q6088117) (← links)