Pages that link to "Item:Q4842116"
From MaRDI portal
The following pages link to When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? (Q4842116):
Displaying 5 items.
- On the relationship between ATSP and the cycle cover problem (Q868952) (← links)
- Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching (Q964867) (← links)
- Probabilistic analysis of bipartite traveling salesman problems (Q2741462) (← links)
- Hamilton cycles in the union of random permutations (Q4761359) (← links)
- Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal (Q4905621) (← links)