Pages that link to "Item:Q3888840"

The following pages link to Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality (Q3888840):

Displaying 50 items.

• Minimum-weight two-connected spanning networks (Q582215) (← links)
• An efficient procedure for the N-city traveling salesman problem (Q583107) (← links)
• An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125) (← links)
• A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126) (← links)
• Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
• A successful algorithm for solving directed Hamiltonian path problems (Q788642) (← links)
• Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
• Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations (Q908860) (← links)
• Facet identification for the symmetric traveling salesman polytope (Q918865) (← links)
• An efficient algorithm for the minimum capacity cut problem (Q922927) (← links)
• Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
• An improved assignment lower bound for the Euclidean traveling salesman problem (Q1058993) (← links)
• A cutting plane procedure for the travelling salesman problem on road networks (Q1072449) (← links)
• The hierarchical network design problem (Q1083378) (← links)
• Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut (Q1089267) (← links)
• A new class of cutting planes for the symmetric travelling salesman problem (Q1107441) (← links)
• A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
• Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
• Facets of the balanced (acyclic) induced subgraph polytope (Q1122491) (← links)
• A cutting plane algorithm for a clustering problem (Q1122492) (← links)
• Heuristics and their design: A survey (Q1152854) (← links)
• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees (Q1170119) (← links)
• The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities (Q1181903) (← links)
• Euclidean semi-matchings of random samples (Q1184341) (← links)
• The traveling salesman problem in graphs with some excluded minors (Q1184343) (← links)
• The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
• Large-step Markov chains for the TSP incorporating local search heuristics (Q1197908) (← links)
• The complexity of lifted inequalities for the knapsack problem (Q1201098) (← links)
• Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
• A branch and bound algorithm for symmetric 2-peripatetic salesman problems (Q1310005) (← links)
• Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation (Q1310113) (← links)
• A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
• Two-edge connected spanning subgraphs and polyhedra (Q1330901) (← links)
• A branch-and-cut algorithm for vehicle routing problems (Q1339118) (← links)
• A polyhedral approach to the rural postman problem (Q1342042) (← links)
• Tabu search performance on the symmetric travelling salesman problem (Q1342103) (← links)
• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. (Q1406627) (← links)
• Cutting-plane proofs in polynomial space (Q1813835) (← links)
• A cutting plane algorithm for minimum perfect 2-matchings (Q1821798) (← links)
• Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
• Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
• Combining simulated annealing with local search heuristics (Q1919834) (← links)
• Computing in combinatorial optimization (Q2075761) (← links)
• On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms (Q2241575) (← links)
• Facets of the three-index assignment polytope (Q2276881) (← links)
• Generating subtour elimination constraints for the TSP from pure integer solutions (Q2358189) (← links)
• Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
• Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865) (← links)
• A partitioning column approach for solving LED sorter manipulator path planning problems (Q2673413) (← links)