Pages that link to "Item:Q5688010"

The following pages link to On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem (Q5688010):

Displaying 28 items.

• Notes on the single route lateral transhipment problem (Q276506) (← links)
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
• Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
• PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems (Q887207) (← links)
• Multi-objective meta-heuristics for the traveling salesman problem with profits (Q928691) (← links)
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
• The online prize-collecting traveling salesman problem (Q963439) (← links)
• The vehicle routing problem with service level constraints (Q1681277) (← links)
• Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
• The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438) (← links)
• The selective traveling salesman problem with emission allocation rules (Q1703461) (← links)
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem (Q1759849) (← links)
• A primal-dual approximation algorithm for the asymmetric prize-collecting TSP (Q1944387) (← links)
• The probabilistic travelling salesman problem with crowdsourcing (Q2146980) (← links)
• Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
• Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics (Q2273922) (← links)
• A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
• Multi-objective vehicle routing problems (Q2480968) (← links)
• Multiperiod integrated spare parts and tour planning for on-site maintenance activities with stochastic repair requests (Q2676368) (← links)
• (Q2861509) (← links)
• Systematic reviews as a metaknowledge tool: caveats and a review of available options (Q6056869) (← links)
• FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704) (← links)
• A revisited branch-and-cut algorithm for large-scale orienteering problems (Q6087525) (← links)
• Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)
• The hazardous orienteering problem (Q6179713) (← links)