Pages that link to "Item:Q1290165"

The following pages link to New classes of efficiently solvable generalized traveling salesman problems (Q1290165):

Displaying 22 items.

• The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
• Job shop scheduling with setup times, deadlines and precedence constraints (Q835609) (← links)
• MIP modelling of changeovers in production planning and scheduling problems (Q1278814) (← links)
• New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization (Q1602710) (← links)
• The multi-stripe travelling salesman problem (Q1698268) (← links)
• Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733) (← links)
• Single-machine scheduling with release times, deadlines, setup times, and rejection (Q2030718) (← links)
• Scheduling for multi-robot routing with blocking and enabling constraints (Q2059084) (← links)
• Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (Q2174903) (← links)
• Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
• A heuristic for cumulative vehicle routing using column generation (Q2357169) (← links)
• An exact algorithm with linear complexity for a problem of visiting megalopolises (Q2396369) (← links)
• Local search for string problems: brute-force is essentially optimal (Q2437744) (← links)
• New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
• A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem (Q2494814) (← links)
• Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
• Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
• Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
• Implementation of a linear time algorithm for certain generalized traveling salesman problems (Q4645932) (← links)
• Dynamic programming in the routing problem: decomposition variant (Q5097703) (← links)
• New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
• A general variable neighborhood search for the traveling salesman problem with time windows under various objectives (Q6153469) (← links)