Pages that link to "Item:Q2441781"

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

Displaying 15 items.

• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (Q336534) (← links)
• The capacitated orienteering problem (Q496434) (← links)
• A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit (Q692666) (← links)
• Cooperative TSP (Q982655) (← links)
• The attractive traveling salesman problem (Q1043335) (← links)
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
• Approximation algorithms for some extensions of the maximum profit routing problem (Q2105889) (← links)
• An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
• Analysis of the selective traveling salesman problem with time-dependent profits (Q2701177) (← links)
• (Q2991763) (← links)
• (Q4494938) (← 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)