Pages that link to "Item:Q810369"
From MaRDI portal
The following pages link to Solution of large-scale symmetric travelling salesman problems (Q810369):
Displaying 10 items.
- Ordered spatial sampling by means of the traveling salesman problem (Q333365) (← links)
- Improved filtering for weighted circuit constraints (Q487627) (← links)
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- Solving the family traveling salesman problem (Q723922) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
- The affine hull of the schedule polytope for servicing identical requests by parallel devices (Q5100122) (← links)
- An approximation algorithm for the clustered path travelling salesman problem (Q6039533) (← links)
- A revisited branch-and-cut algorithm for large-scale orienteering problems (Q6087525) (← links)
- Mixed-integer programming techniques for the minimum sum-of-squares clustering problem (Q6166100) (← links)
