Pages that link to "Item:Q5246822"

The following pages link to A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks (Q5246822):

Displaying 5 items.

• What are the worst cases in constrained last-in-first-out pick-up and delivery problems? (Q1651694) (← links)
• Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
• Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2670579) (← links)
• New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2968488) (← links)
• The double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6071059) (← links)