Pages that link to "Item:Q2884495"

The following pages link to Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study (Q2884495):

Displaying 34 items.

• A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← links)
• Job shop scheduling with setup times, deadlines and precedence constraints (Q835609) (← links)
• Dominance guarantees for above-average solutions (Q937396) (← links)
• A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884) (← links)
• Upper bounds on ATSP neighborhood size. (Q1406047) (← links)
• Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) (← 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)
• Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version (Q2108179) (← links)
• A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times (Q2148147) (← links)
• Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (Q2174903) (← links)
• Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
• Algorithms for automatic ranking of participants and tasks in an anonymized contest (Q2272379) (← links)
• Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
• Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
• An exact algorithm with linear complexity for a problem of visiting megalopolises (Q2396369) (← links)
• Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems (Q2428688) (← links)
• New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
• Solution of real-world postman problems (Q2482818) (← links)
• Further extension of the TSP assign neighborhood (Q2491321) (← 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)
• A new ILP-based refinement heuristic for vehicle routing problems (Q2583137) (← 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)
• A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows (Q2815434) (← links)
• New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows (Q2815450) (← links)
• Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP (Q5458509) (← links)
• Repeat inspection planning using dynamic programming (Q5478820) (← links)
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← 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)
• A comprehensive survey on the generalized traveling salesman problem (Q6556079) (← links)
• Reliable production process design problem: compact MILP model and ALNS-based primal heuristic (Q6588744) (← links)