Pages that link to "Item:Q2441781"

The following pages link to Complexity and approximation for traveling salesman problems with profits (Q2441781):

Displaying 6 items.

• The capacitated orienteering problem (Q496434) (← links)
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
• An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
• Solving the probabilistic profitable tour problem on a line (Q6081600) (← links)
• A revisited branch-and-cut algorithm for large-scale orienteering problems (Q6087525) (← links)
• The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario (Q6609709) (← links)