Pages that link to "Item:Q4540081"

The following pages link to A branch-and-cut algorithm for the undirected selective traveling salesman problem (Q4540081):

Displaying 50 items.

• The clustered orienteering problem (Q296772) (← links)
• Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
• A two-stage approach to the orienteering problem with stochastic weights (Q336923) (← links)
• Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
• The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
• Analysis of the maximum level policy in a production-distribution system (Q547123) (← links)
• The orienteering problem: a survey (Q617509) (← links)
• The selective travelling salesman problem (Q910347) (← links)
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming (Q958452) (← links)
• A path relinking approach for the team orienteering problem (Q975993) (← links)
• A tabu search heuristic for the undirected selective travelling salesman problem (Q1609914) (← links)
• Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem (Q1651640) (← links)
• A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← links)
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
• Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
• Formulations for the orienteering problem with additional constraints (Q1686508) (← 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)
• Attractive orienteering problem with proximity and timing interactions (Q1754098) (← links)
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints (Q1754303) (← links)
• The vehicle routing problem with profits and consistency constraints (Q1755266) (← links)
• A TABU search heuristic for the team orienteering problem (Q1764755) (← links)
• Locating median cycles in networks (Q1887911) (← links)
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← links)
• Coupling ant colony systems with strong local searches (Q1926808) (← links)
• A Tabu search algorithm for the probabilistic orienteering problem (Q2026967) (← links)
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007) (← links)
• Mixed-integer programming approaches for the time-constrained maximal covering routing problem (Q2241905) (← links)
• A location-routing problem in glass recycling (Q2259043) (← links)
• A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← links)
• Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics (Q2273922) (← links)
• A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
• A branch-and-cut algorithm for the target visitation problem (Q2294072) (← links)
• A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
• A fast solution method for the time-dependent orienteering problem (Q2356249) (← links)
• A guided local search metaheuristic for the team orienteering problem (Q2378455) (← links)
• Evolution-inspired local improvement algorithm solving orienteering problem (Q2399337) (← links)
• A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
• Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem (Q2479572) (← links)
• A memetic algorithm for the orienteering problem with hotel selection (Q2514808) (← links)
• A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection (Q2664333) (← links)
• A branch-and-cut approach for the distributed no-wait flowshop scheduling problem (Q2676404) (← links)
• Stronger column generation bounds for the minimum cost hop-and-root constrained forest problem (Q2840729) (← links)
• An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (Q2940530) (← links)
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103) (← links)
• A two-stage vehicle routing model for large-scale bioterrorism emergencies (Q3057125) (← links)
• A time-based formulation and upper bounding scheme for the selective travelling salesperson problem (Q4347416) (← links)
• AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES (Q5315817) (← links)
• The orienteering problem with variable profits (Q5326782) (← links)
• Branch-and-cut algorithms for the covering salesman problem (Q6050582) (← links)