The following pages link to TSPLIB (Q13727):
Displaying 50 items.
- A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
- A heuristic for the pickup and delivery traveling salesman problem (Q1571039) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Application of the noising method to the travelling salesman problem (Q1580974) (← links)
- An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
- Heuristic procedures for the capacitated vehicle routing problem (Q1588831) (← links)
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints (Q1588841) (← links)
- A statistical analysis of simulated annealing applied to the \(p\)-median problem (Q1593521) (← links)
- The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem. (Q1597083) (← links)
- A new variant of a vehicle routing problem: Lower and upper bounds (Q1598727) (← links)
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
- Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
- Relaxed tours and path ejections for the traveling salesman problem (Q1609913) (← links)
- Separating capacity constraints in the CVRP using tabu search (Q1609917) (← links)
- Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities. (Q1611005) (← links)
- Nagging: A scalable fault-tolerant paradigm for distributed search (Q1614863) (← links)
- A matheuristic approach to the orienteering problem with service time dependent profits (Q1622800) (← links)
- A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem (Q1628059) (← links)
- The time constrained maximal covering salesman problem (Q1631991) (← links)
- Visual attractiveness in routing problems: a review (Q1634050) (← links)
- Making a state-of-the-art heuristic faster with data mining (Q1639223) (← links)
- A parametric hybrid method for the traveling salesman problem (Q1649273) (← links)
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems (Q1651515) (← links)
- An iterated local search for the traveling salesman problem with release dates and completion time minimization (Q1651639) (← links)
- Intelligent-guided adaptive search for the maximum covering location problem (Q1652063) (← links)
- A VNS approach to multi-location inventory redistribution with vehicle routing (Q1652123) (← links)
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem (Q1652176) (← links)
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment (Q1652330) (← links)
- An improved ant colony system for the sequential ordering problem (Q1652370) (← links)
- An efficient evolutionary algorithm for the orienteering problem (Q1652505) (← links)
- An efficient implementation of a static move descriptor-based local search heuristic (Q1652594) (← links)
- Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading (Q1652699) (← links)
- Integer programming models and linearizations for the traveling car renter problem (Q1653275) (← links)
- Generalization of the restricted planar location problems: unified metaheuristic algorithms (Q1654346) (← links)
- Introducing complexity curtailing techniques for the tour construction heuristics for the travelling salesperson problem (Q1659213) (← links)
- A hybrid approach for biobjective optimization (Q1662163) (← links)
- Solving large-scale TSP using a fast wedging insertion partitioning approach (Q1666767) (← links)
- A general variable neighborhood search variants for the travelling salesman problem with draft limits (Q1677289) (← links)
- An exact algorithm for the minimum dilation triangulation problem (Q1679486) (← links)
- The traveling salesman problem on grids with forbidden neighborhoods (Q1680496) (← links)
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (Q1683123) (← links)
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem (Q1686519) (← links)
- New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
- Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme (Q1701902) (← links)
- How efficient is a global constraint in practice? A fair experimental framework (Q1706598) (← links)
- Variable neighborhood search: basics and variants (Q1707084) (← links)
- A new adaptive Hungarian mating scheme in genetic algorithms (Q1726046) (← links)
