Pages that link to "Item:Q810369"
From MaRDI portal
The following pages link to Solution of large-scale symmetric travelling salesman problems (Q810369):
Displaying 35 items.
- Generating subtour elimination constraints for the TSP from pure integer solutions (Q2358189) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning (Q2517895) (← links)
- Improved large-step Markov chain variants for the symmetric TSP (Q2567843) (← links)
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833) (← links)
- A learning based algorithm for drone routing (Q2669632) (← links)
- Point-to-point and multi-goal path planning for industrial robots (Q2745507) (← links)
- Chained Lin-Kernighan for large traveling salesman problems (Q2884550) (← links)
- On the polytope faces of the graph approximation problem (Q3186827) (← links)
- Nonoptimal Edges for the Symmetric Traveling Salesman Problem (Q3337972) (← links)
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems (Q3362088) (← links)
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems (Q3753823) (← links)
- Vehicle routing with stochastic demands and restricted failures (Q4201811) (← links)
- (Q4263707) (← links)
- Exact solution of large-scale, asymmetric traveling salesman problems (Q4371607) (← links)
- Separating maximally violated comb inequalities in planar graphs (Q4645943) (← links)
- Provably good solutions for the traveling salesman problem (Q4698114) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
- ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH (Q5070863) (← links)
- The affine hull of the schedule polytope for servicing identical requests by parallel devices (Q5100122) (← links)
- Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP (Q5284220) (← links)
- On facet-inducing inequalities for combinatorial polytopes (Q5374012) (← links)
- Solution of a Large-Scale Traveling-Salesman Problem (Q5378639) (← links)
- Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem (Q5888090) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
- Affinity propagation and uncapacitated facility location problems (Q5964469) (← 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)
- An approximation algorithm for the clustered path travelling salesman problem (Q6167001) (← links)
- Deep clustering of the traveling salesman problem to parallelize its solution (Q6561208) (← links)
