Pages that link to "Item:Q3753823"

The following pages link to An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems (Q3753823):

Displaying 27 items.

• A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms (Q257224) (← links)
• TSP race: minimizing completion time in time-sensitive applications (Q319282) (← links)
• Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
• The coastal seaspace patrol sector design and allocation problem (Q395695) (← links)
• Classification of travelling salesman problem formulations (Q911990) (← links)
• Transformation of multidepot multisalesmen problem to the standard travelling salesman problem (Q1130070) (← links)
• The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
• Topological design of ring networks (Q1318461) (← links)
• Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem (Q1666220) (← links)
• Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem (Q1824571) (← links)
• New lower bounds for the symmetric travelling salesman problem (Q1824572) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
• The multiagent planning problem (Q2012788) (← links)
• The \(m\)-Steiner traveling salesman problem with online edge blockages (Q2045027) (← links)
• Hybrid search with neighborhood reduction for the multiple traveling salesman problem (Q2146986) (← links)
• Algorithms for the design of network topologies with balanced disjoint rings (Q2267818) (← links)
• Integration of equipment planning and project scheduling (Q2384850) (← links)
• A note on relatives to the Held and Karp 1-tree problem (Q2494821) (← links)
• Integer linear programming formulations of multiple salesman problems and its variations (Q2503218) (← links)
• MineReduce: an approach based on data mining for problem size reduction (Q2664324) (← links)
• Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach (Q2668611) (← links)
• Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem (Q2903995) (← links)
• Graphical-structure-based models for routing problems (Q3799805) (← links)
• Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies (Q5939582) (← links)
• On the shortest path problem with negative cost cycles (Q5963684) (← links)
• A branch-and-bound approach for a vehicle routing problem with customer costs (Q6114901) (← links)