Pages that link to "Item:Q5378639"

The following pages link to Solution of a Large-Scale Traveling-Salesman Problem (Q5378639):

Displaying 50 items.

• Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
• Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← links)
• Polarity and the complexity of the shooting experiment (Q951126) (← links)
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
• A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
• An efficient optimal solution to the coil sequencing problem in electro-galvanizing line (Q976044) (← links)
• The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
• An ant colony system for enhanced loop-based aisle-network design (Q992586) (← links)
• Certification of an optimal TSP tour through 85,900 cities (Q1002076) (← links)
• A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
• A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem (Q1026674) (← links)
• Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration (Q1046714) (← links)
• The complexity of facets (and some facets of complexity) (Q1061485) (← links)
• A cutting plane procedure for the travelling salesman problem on road networks (Q1072449) (← links)
• The hierarchical network design problem (Q1083378) (← links)
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut (Q1089267) (← links)
• The complexity of facets resolved (Q1109565) (← links)
• A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
• Models and exact solutions for a class of stochastic location-routing problems (Q1123112) (← links)
• On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
• On the choice of step size in subgradient optimization (Q1149883) (← links)
• Hamiltonian location problems (Q1173005) (← links)
• A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem (Q1178723) (← links)
• A note on the effect of neighborhood structure in simulated annealing (Q1184445) (← links)
• The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
• Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient (Q1226033) (← links)
• An approach for solving a class of transportation scheduling problems (Q1251987) (← links)
• The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem (Q1261382) (← links)
• A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (Q1266514) (← links)
• An empirical study of a new metaheuristic for the traveling salesman problem (Q1291637) (← links)
• A cutting-plane approach to the edge-weighted maximal clique problem (Q1309944) (← links)
• Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem (Q1310959) (← links)
• A two-dimensional mapping for the traveling salesman problem (Q1324376) (← links)
• Vehicle routing with split deliveries (Q1327209) (← links)
• The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602) (← links)
• Tabu search performance on the symmetric travelling salesman problem (Q1342103) (← links)
• The pickup and delivery problem: Faces and branch-and-cut algorithm (Q1368475) (← links)
• A classification of formulations for the (time-dependent) traveling salesman problem (Q1388929) (← links)
• A bilevel programming approach to the travelling salesman problem. (Q1426728) (← links)
• A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex (Q1577763) (← links)
• Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• Computational approaches for zero forcing and related problems (Q1631510) (← links)
• A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
• Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314) (← links)
• A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines (Q1652346) (← links)
• Integer programming models and linearizations for the traveling car renter problem (Q1653275) (← links)
• Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope (Q1662101) (← links)
• A hybrid approach for biobjective optimization (Q1662163) (← links)