The following pages link to TSPLIB (Q13727):
Displaying 50 items.
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317) (← links)
- Multiperiod location-routing with decoupled time scales (Q439365) (← links)
- A binary particle swarm optimization algorithm inspired by multi-level organizational learning behavior (Q439651) (← links)
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
- An iterated local search for the budget constrained generalized maximal covering location problem (Q483216) (← links)
- Single-facility huff location problems on networks (Q490213) (← links)
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Advances in bio-inspired computing for combinatorial optimization problems (Q494689) (← links)
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453) (← links)
- A discrete gravitational search algorithm for solving combinatorial optimization problems (Q498096) (← links)
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm (Q499157) (← links)
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
- An exact algorithm for the clustered travelling salesman problem (Q505157) (← links)
- New local searches for solving the multi-source Weber problem (Q512988) (← links)
- Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163) (← links)
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand (Q519091) (← links)
- Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
- Rank aggregation in cyclic sequences (Q523159) (← links)
- Symmetric weight constrained traveling salesman problem: Local search (Q535615) (← links)
- Genetic algorithm for combinatorial path planning: the subtour problem (Q541476) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms (Q543817) (← links)
- A framework for analyzing sub-optimal performance of local search algorithms (Q548682) (← links)
- The neighbor-net algorithm (Q550258) (← links)
- A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (Q602676) (← links)
- A decomposition heuristic for the maximal covering location problem (Q606191) (← links)
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions (Q609175) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- Evolutionary self-adaptation: a survey of operators and strategy parameters (Q613015) (← links)
- A heuristic procedure for the capacitated \(m\)-ring-star problem (Q613432) (← links)
- The balanced traveling salesman problem (Q614063) (← links)
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484) (← links)
- Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
- Variable neighborhood search for harmonic means clustering (Q636511) (← links)
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm (Q643033) (← links)
- Approximating the metric TSP in linear time (Q649110) (← links)
- Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- Improving genetic algorithm with fine-tuned crossover and scaled architecture (Q670576) (← links)
- A modified Lin--Kernighan traveling-salesman heuristic (Q688925) (← links)
- Solving combinatorial optimization problems using augmented Lagrange chaotic simulated annealing (Q691303) (← links)
- 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem (Q691417) (← links)
- Canonical dual approach to solving the maximum cut problem (Q693126) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- GENI ants for the traveling salesman problem (Q702722) (← links)
- Multilevel refinement for combinatorial optimisation problems (Q702735) (← links)
- A library of local search heuristics for the vehicle routing problem (Q708775) (← links)
- A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants (Q716345) (← links)
