Pages that link to "Item:Q5661324"

The following pages link to Algorithms for Large-scale Travelling Salesman Problems (Q5661324):

Displaying 18 items.

• Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
• A variable depth search branching (Q453047) (← links)
• A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126) (← links)
• Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
• A successful algorithm for solving directed Hamiltonian path problems (Q788642) (← links)
• Tourenplanung für zwei Depots bei offenen Touren (Q788646) (← links)
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← links)
• The vehicle routing problem with backhauls (Q1119178) (← links)
• The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
• An approach for solving a class of transportation scheduling problems (Q1251987) (← links)
• A Lagrangean heuristic for the maximal covering location problem (Q1266569) (← links)
• An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
• A vehicle routing improvement algorithm comparison of a ''greedy'' and a matching implementation for inventory routing (Q1820686) (← links)
• Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• Sequential search and its application to vehicle-routing problems (Q2489298) (← links)
• Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations (Q2669602) (← links)