Pages that link to "Item:Q2011598"

The following pages link to Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks (Q2011598):

Displaying 9 items.

• Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
• Rejoinder on: ``Perspectives on integer programming for time-dependent models'' (Q2001860) (← links)
• A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262) (← links)
• Branch-and-refine for solving time-expanded MILP formulations (Q2108138) (← links)
• Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version (Q2108179) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
• A general variable neighborhood search for the traveling salesman problem with time windows under various objectives (Q6153469) (← links)
• A continuous‐time service network design and vehicle routing problem (Q6196874) (← links)