Pages that link to "Item:Q1194761"

The following pages link to The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761):

Displayed 25 items.

• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times (Q706984) ‎ (← links)
• The vehicle routing problem: An overview of exact and approximate algorithms (Q1198313) ‎ (← links)
• Genetic algorithms and traveling salesman problems (Q1268132) ‎ (← links)
• A new subtour elimination constraint for the vehicle routing problem (Q1278251) ‎ (← links)
• Planning models for freight transportation (Q1278638) ‎ (← links)
• An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs (Q1280545) ‎ (← links)
• Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study (Q1296791) ‎ (← links)
• Workload planning in small lot printed circuit board assembly (Q1374396) ‎ (← links)
• A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex (Q1577763) ‎ (← links)
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) ‎ (← links)
• Vehicle routing-scheduling for waste collection in Hanoi (Q1582030) ‎ (← links)
• Current modeling practices in bank courier scheduling (Q1590431) ‎ (← links)
• Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) ‎ (← links)
• Extensions to the generalised assignment heuristic for vehicle routing (Q1806768) ‎ (← links)
• Guided local search and its application to the traveling salesman problem (Q1808420) ‎ (← links)
• Designing multi-vehicle delivery tours in a grid-cell format (Q1809842) ‎ (← links)
• A sweep-based algorithm for the fleet size and mix vehicle routing problem (Q1848592) ‎ (← links)
• A new heuristic for the period traveling salesman problem (Q1894732) ‎ (← links)
• Routing problems: A bibliography (Q1908308) ‎ (← links)
• Divide and conquer strategies for parallel TSP heuristics (Q1919776) ‎ (← links)
• Genetic algorithms for the traveling salesman problem (Q1919848) ‎ (← links)
• Searching the components of the solution: The factor-based random search algorithm for ETSP (Q4229560) ‎ (← links)
• Efficient operation of a surface mounting machine with a multihead turret (Q4230130) ‎ (← links)
• On the vehicle routing problem (Q4378935) ‎ (← links)
• The Rural Postman Problem on mixed graphs with turn penalties (Q5959378) ‎ (← links)