Pages that link to "Item:Q2189879"

The following pages link to A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879):

Displaying 13 items.

• A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262) (← links)
• Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
• A time bucket formulation for the traveling salesman problem with time windows (Q2815434) (← links)
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem (Q4367232) (← links)
• Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints (Q5040957) (← links)
• Mixed integer programming formulations for the generalized traveling salesman problem with time windows (Q6057720) (← links)
• Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
• The capacitated family traveling salesperson problem (Q6195021) (← links)
• Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem (Q6488350) (← links)
• The polynomial randomized algorithm to compute bounded degree graph for TSP based on frequency quadrilaterals (Q6535280) (← links)
• Modeling and solving the two-level generalized median tour problem (Q6551171) (← links)
• A comprehensive survey on the generalized traveling salesman problem (Q6556079) (← links)