Pages that link to "Item:Q320686"

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

Displaying 15 items.

• The multi-objective generalized consistent vehicle routing problem (Q320011) (← links)
• 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)
• A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262) (← links)
• Binary driver-customer familiarity in service routing (Q2184137) (← links)
• A branch-and-cut algorithm for the target visitation problem (Q2294072) (← links)
• Discrete optimization model and algorithm for driver planning in periodic driver routing problem (Q2296607) (← links)
• Branch-and-check approaches for the tourist trip design problem with rich constraints (Q2669676) (← links)
• The consistent vehicle routing problem with heterogeneous fleet (Q2669772) (← links)
• A template-based adaptive large neighborhood search for the consistent vehicle routing problem (Q2811324) (← links)
• (Q4414638) (← links)
• Branch-and-cut algorithms for the covering salesman problem (Q6050582) (← 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)
• Mathematical formulations for consistent travelling salesman problems (Q6555132) (← links)