Pages that link to "Item:Q4066863"
From MaRDI portal
The following pages link to Some Simple Applications of the Travelling Salesman Problem (Q4066863):
Displayed 17 items.
- Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (Q911455) (← links)
- The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562) (← links)
- Gray codes with restricted density (Q1062075) (← links)
- Vehicle routing with full loads (Q1099072) (← links)
- Solution of placement and routing problems in telephone exchange unit designs (Q1109671) (← links)
- Assignment of tools to machines in a flexible manufacturing system (Q1130034) (← links)
- Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation (Q1162090) (← links)
- Verschnittoptimierung im praktischen Einsatz. Eine Fallstudie (Q1168886) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- The vehicle routing problem: An overview of exact and approximate algorithms (Q1198313) (← links)
- Constructing blockmodels: how and why (Q1245783) (← links)
- A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex (Q1577763) (← links)
- Asymptotic expected performance of some TSP heuristics: An empirical evaluation (Q1823875) (← links)
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots (Q2427108) (← links)
- Integer linear programming formulations of multiple salesman problems and its variations (Q2503218) (← links)
- Vehicle routing with stochastic demands and restricted failures (Q4201811) (← links)