Pages that link to "Item:Q3582631"
From MaRDI portal
The following pages link to A concise guide to the Traveling Salesman Problem (Q3582631):
Displaying 11 items.
- A cutting plane method for solving harvest scheduling models with area restrictions (Q257266) (← links)
- MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem (Q322470) (← links)
- Adapting the traveling salesman problem to an adiabatic quantum computer (Q352991) (← links)
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
- Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios (Q513625) (← links)
- Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs (Q895762) (← links)
- An efficient evolutionary algorithm for the ring star problem (Q2356203) (← links)
- A learning based algorithm for drone routing (Q2669632) (← links)
- Routing Optimization Under Uncertainty (Q2806069) (← links)
- Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← links)
- Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context (Q6559404) (← links)
