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):
Displayed 5 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)
- A generalization of Polyak's convergence result for subgradient optimization (Q3768688) (← links)
- Graphical-structure-based models for routing problems (Q3799805) (← links)
