Pages that link to "Item:Q2503218"

The following pages link to Integer linear programming formulations of multiple salesman problems and its variations (Q2503218):

Displaying 23 items.

• Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
• Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations (Q337182) (← links)
• Multi-depot multiple TSP: a polyhedral study and computational results (Q367624) (← links)
• Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709) (← links)
• Multiperiod location-routing with decoupled time scales (Q439365) (← links)
• A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector (Q490386) (← links)
• The school bus routing problem: a review (Q1039772) (← links)
• Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times (Q1628056) (← links)
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
• Minimizing dispersion in multiple drone routing (Q2003561) (← links)
• Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case (Q2005780) (← links)
• The multiagent planning problem (Q2012788) (← links)
• An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem (Q2147041) (← links)
• An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets (Q2283818) (← links)
• Splitting a giant tour using integer linear programming (Q2631278) (← links)
• Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach (Q2668611) (← links)
• Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations (Q2669602) (← links)
• Unrelated parallel machine scheduling problem with special controllable processing times and setups (Q2676390) (← links)
• Comparison of Tabu/2-opt heuristic and optimal tree search method for assignment problems (Q2903985) (← links)
• Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem (Q2903995) (← links)
• Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries (Q2948920) (← links)
• VEHICLE ROUTE OPTIMIZATION FOR RFID INTEGRATED WASTE COLLECTION SYSTEM (Q3601297) (← links)
• Unrelated parallel machine energy-efficient scheduling considering sequence-dependent setup times and time-of-use electricity tariffs (Q6491320) (← links)