Pages that link to "Item:Q1083379"

The following pages link to The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm (Q1083379):

Displaying 11 items.

• Transformation of multidepot multisalesmen problem to the standard travelling salesman problem (Q1130070) (← links)
• A new variant of a vehicle routing problem: Lower and upper bounds (Q1598727) (← 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)
• Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem (Q2214785) (← links)
• An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets (Q2283818) (← links)
• A simple model for the multiple traveling salesmen problem with single depot and multiple sink (Q2970607) (← links)
• A generalization of Polyak's convergence result for subgradient optimization (Q3768688) (← links)
• Graphical-structure-based models for routing problems (Q3799805) (← links)
• On the shortest path problem with negative cost cycles (Q5963684) (← links)