Pages that link to "Item:Q1083379"
From MaRDI portal
The following pages link to The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm (Q1083379):
Displaying 19 items.
- A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem (Q911484) (← links)
- Transformation of multidepot multisalesmen problem to the standard travelling salesman problem (Q1130070) (← links)
- The minimax problem of \(M\)-travelling salesmen (Q1190104) (← links)
- A new variant of a vehicle routing problem: Lower and upper bounds (Q1598727) (← links)
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints (Q1806889) (← links)
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
- The multiagent planning problem (Q2012788) (← links)
- High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system (Q2029029) (← 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)
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems (Q3753823) (← links)
- A generalization of Polyak's convergence result for subgradient optimization (Q3768688) (← links)
- Graphical-structure-based models for routing problems (Q3799805) (← links)
- An algorithm for the \(M\) asymmetric travelling salesman problem on a bandwidth-limited graph (Q3991499) (← links)
- A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems (Q4018534) (← links)
- On the shortest path problem with negative cost cycles (Q5963684) (← links)
- Hybridizing simulated annealing and genetic algorithms with Pythagorean fuzzy uncertainty for traveling salesman problem optimization (Q6578207) (← links)
