Pages that link to "Item:Q320686"

The following pages link to A branch-and-cut framework for the consistent traveling salesman problem (Q320686):

Displaying 7 items.

• Product-oriented time window assignment for a multi-compartment vehicle routing problem (Q1734344) (← links)
• The vehicle routing problem with profits and consistency constraints (Q1755266) (← links)
• Binary driver-customer familiarity in service routing (Q2184137) (← links)
• Discrete optimization model and algorithm for driver planning in periodic driver routing problem (Q2296607) (← links)
• The consistent vehicle routing problem with heterogeneous fleet (Q2669772) (← links)
• The time‐consistent dial‐a‐ride problem (Q6065902) (← links)
• The travelling salesman problem with positional consistency constraints: an application to healthcare services (Q6167660) (← links)