Pages that link to "Item:Q4519128"

The following pages link to A polyhedral study of the asymmetric traveling salesman problem with time windows (Q4519128):

Displaying 8 items.

• A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← links)
• A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
• Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
• History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence (Q342093) (← links)
• The delivery man problem with time windows (Q429673) (← links)
• Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
• Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801) (← links)