Some Simple Applications of the Travelling Salesman Problem
From MaRDI portal
Cited in
(37)- The optimum assignments and a new heuristic approach for the traveling salesman problem
- Gray codes with restricted density
- Vehicle routing with full loads
- Solution of placement and routing problems in telephone exchange unit designs
- Assignment of tools to machines in a flexible manufacturing system
- Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
- Verschnittoptimierung im praktischen Einsatz. Eine Fallstudie
- The traveling salesman problem: An overview of exact and approximate algorithms
- The vehicle routing problem: An overview of exact and approximate algorithms
- Constructing blockmodels: how and why
- A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
- Introducing complexity curtailing techniques for the tour construction heuristics for the travelling salesperson problem
- Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem
- Asymptotic expected performance of some TSP heuristics: An empirical evaluation
- Can the agent with limited information solve travelling salesman problem?
- Exact distributional analysis of online algorithms with lookahead
- Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
- Learning the travelling salesperson problem requires rethinking generalization
- A speciation-based bilevel niching method for multimodal truss design problems
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots
- Integer linear programming formulations of multiple salesman problems and its variations
- Modeling supermarket re-layout from the owner's perspective
- A new mathematical programming formulation for the single-picker routing problem
- Ordered spatial sampling by means of the traveling salesman problem
- Multiperiod planning and routing on a rolling horizon for field force optimization logistics
- Vehicle routing with stochastic demands and restricted failures
- Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem
- GADMM: fast and communication efficient framework for distributed machine learning
- A variable neighborhood search algorithm for cost-balanced travelling salesman problem
- Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem
- Multiple depot vehicle routing problems on clustering algorithms
- Travelling on graphs with small highway dimension
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
- A network flow model for biclustering via optimal re-ordering of data matrices
This page was built for publication: Some Simple Applications of the Travelling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4066863)
