The following pages link to (Q3701213):
Displayed 5 items.
- Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (Q408370) (← links)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (Q1266514) (← links)
- On the complexity of postoptimality analysis of \(0/1\) programs (Q1283802) (← links)
- Efficient web searching using temporal factors (Q5958137) (← links)