The following pages link to TSPLIB (Q13727):
Displaying 50 items.
- Solving the traveling salesman problem with interdiction and fortification (Q1728213) (← links)
- Computational study on a PTAS for planar dominating set problem (Q1736542) (← links)
- COOBBO: a novel opposition-based soft computing algorithm for TSP problems (Q1736627) (← links)
- Efficiently solving very large-scale routing problems (Q1738815) (← links)
- A hybrid optimization approach for the Steiner \(k\)-connected network design problem (Q1742248) (← links)
- Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
- Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering (Q1749775) (← links)
- Multi-criteria optimization for last mile distribution of disaster relief aid: test cases and applications (Q1750463) (← links)
- Local search inequalities (Q1751111) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (Q1751254) (← links)
- The packing while traveling problem (Q1751654) (← links)
- The pickup and delivery traveling salesman problem with handling costs (Q1752776) (← links)
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane (Q1752856) (← links)
- New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
- Identification of unidentified equality constraints for integer programming problems (Q1753456) (← links)
- Exact algorithms for the equitable traveling salesman problem (Q1753595) (← links)
- A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique (Q1756799) (← links)
- Multi-parent extension of sequential constructive crossover for the travelling salesman problem (Q1758842) (← links)
- A data-guided lexisearch algorithm for the bottleneck travelling salesman problem (Q1758845) (← links)
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem (Q1759849) (← links)
- An integer programming-based local search for the covering salesman problem (Q1761202) (← links)
- Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975) (← links)
- Some issues of designing genetic algorithms for traveling salesman problems (Q1764595) (← links)
- A new memetic algorithm for the asymmetric traveling salesman problem (Q1771206) (← links)
- A theoretical study on the behavior of simulated annealing leading to a new cooling schedule (Q1779535) (← links)
- The approximation ratio of the greedy algorithm for the metric traveling salesman problem (Q1785355) (← links)
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows (Q1788902) (← links)
- The multiple traveling salesman problem with backup coverage (Q1791936) (← links)
- Candidate groups search for K-harmonic means data clustering (Q1792370) (← links)
- New TSP construction heuristics and their relationships to the 2-Opt (Q1806710) (← links)
- Cluster based branching for the asymmetric traveling salesman problem (Q1806732) (← links)
- Parallel local search for Steiner trees in graphs (Q1808193) (← links)
- Guided local search and its application to the traveling salesman problem (Q1808420) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- A hybrid heuristic for the \(p\)-median problem (Q1826490) (← links)
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems (Q1826491) (← links)
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- A learning method in Hopfield neural network for combinatorial optimization problem (Q1852049) (← links)
- Case injected genetic algorithms for traveling salesman problems (Q1854036) (← links)
- Fuzzy J-means: a new heuristic for fuzzy clustering (Q1860175) (← links)
- A parallel implementation of ant colony optimization. (Q1867337) (← links)
- Optimization-oriented global constraints (Q1871972) (← links)
- A new branch-and-cut algorithm for the capacitated vehicle routing problem (Q1881569) (← links)
- Embedded local search approaches for routing optimization (Q1886851) (← links)
- Data structures and ejection chains for solving large-scale traveling salesman problems (Q1887873) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Combining simulated annealing with local search heuristics (Q1919834) (← links)
- Designing and reporting on computational experiments with heuristic methods (Q1922625) (← links)
