Pages that link to "Item:Q4175048"
From MaRDI portal
The following pages link to Using cutting planes to solve the symmetric Travelling Salesman problem (Q4175048):
Displaying 15 items.
- Distance conserving reductions for nonoriented networks (Q594774) (← links)
- A cutting plane procedure for the travelling salesman problem on road networks (Q1072449) (← links)
- A new class of cutting planes for the symmetric travelling salesman problem (Q1107441) (← links)
- An exact algorithm for minimizing routing and operating costs in depot location (Q1148218) (← links)
- Design of electricity supply networks (Q1171505) (← links)
- Hamiltonian location problems (Q1173005) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- An efficient genetic algorithm for the traveling salesman problem with precedence constraints (Q1848588) (← links)
- Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm (Q2283932) (← links)
- Gomory cuts revisited (Q2564234) (← links)
- A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
- Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem (Q5114991) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
- The solution of some 100-city travelling salesman problems (Q6169991) (← links)
- Some contributions of Ailsa H. Land to the study of the traveling salesman problem (Q6169992) (← links)
