Cited in
(only showing first 100 items - show all)- Generalization of machine learning for problem reduction: a case study on travelling salesman problems
- A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM
- scientific article; zbMATH DE number 1974039 (Why is no real title available?)
- Minimization and maximization versions of the quadratic travelling salesman problem
- Simulated annealing with an optimal fixed temperature
- A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms
- Visiting near-optimal solutions using local search algorithms
- A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
- A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities
- Tolerance-based branch and bound algorithms for the ATSP
- First vs. best improvement: an empirical study
- Branch-and-bound for the precedence constrained generalized traveling salesman problem
- scientific article; zbMATH DE number 2084783 (Why is no real title available?)
- scientific article; zbMATH DE number 1953192 (Why is no real title available?)
- scientific article; zbMATH DE number 780782 (Why is no real title available?)
- A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results
- Multilevel refinement for combinatorial optimisation problems
- Chained Lin-Kernighan for large traveling salesman problems
- Evolutionary Computation in Combinatorial Optimization
- A new formulation and resolution method for the \(p\)-center problem
- Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem
- Ant algorithms: theory and applications
- Generating subtour elimination constraints for the TSP from pure integer solutions
- Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection
- Solving combinatorial optimization problems using augmented Lagrange chaotic simulated annealing
- On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm
- A new adaptive Hungarian mating scheme in genetic algorithms
- Solving the traveling salesman problem with interdiction and fortification
- Metaheuristics and cooperative approaches for the bi-objective ring star problem
- Reducing the Size of Travelling Salesman Problem Instances by Fixing Edges
- Metaheuristic applications on discrete facility location problems: a survey
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Symmetric weight constrained traveling salesman problem: Local search
- Modifications of the two-stage transportation problem and their applications
- Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
- Solving the traveling delivery person problem with limited computational time
- An Effective PSO-Based Memetic Algorithm for TSP
- Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem
- scientific article; zbMATH DE number 1532269 (Why is no real title available?)
- Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities.
- Nagging: A scalable fault-tolerant paradigm for distributed search
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- scientific article; zbMATH DE number 2086917 (Why is no real title available?)
- Mileage bands in freight transportation
- A scatter search approach for the minimum sum-of-squares clustering problem
- scientific article; zbMATH DE number 5582828 (Why is no real title available?)
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem
- IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- Optimization of the nibbling operation on an NC turret punch press
- Measuring the Performance of Parallel Metaheuristics
- Cuts for mixed 0-1 conic programming
- Routing problems with loading constraints
- Planar branch decompositions. I: The ratcatcher
- Planar branch decompositions. II: The cycle method
- Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
- Exponential irreducible neighborhoods for combinatorial optimization problems
- Parallel local search for Steiner trees in graphs
- Incremental SAT-based method with native Boolean cardinality handling for the Hamiltonian cycle problem
- A self-organising model for the travelling salesman problem
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Case injected genetic algorithms for traveling salesman problems
- scientific article; zbMATH DE number 1688604 (Why is no real title available?)
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
- Minimum cycle partition with length requirements
- Computing Euclidean Steiner trees over segments
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- scientific article; zbMATH DE number 1566497 (Why is no real title available?)
- scientific article; zbMATH DE number 5017341 (Why is no real title available?)
- Decomposition strategies for large-scale continuous location–allocation problems
- Multi-parent extension of sequential constructive crossover for the travelling salesman problem
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
- The balanced billing cycle vehicle routing problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- Genetic algorithm for combinatorial path planning: the subtour problem
- Computing compatible tours for the symmetric traveling salesman problem
- A framework for analyzing sub-optimal performance of local search algorithms
- scientific article; zbMATH DE number 2064413 (Why is no real title available?)
- Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP
- scientific article; zbMATH DE number 1944875 (Why is no real title available?)
- scientific article; zbMATH DE number 1953117 (Why is no real title available?)
- Prize-collecting TSP with a budget constraint
- Solution bias in ant colony optimisation: Lessons for selecting pheromone models
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
- The generalized covering salesman problem
- Optimizing a ring-based private line telecommunication network using tabu search
- A Study of Domino-Parity and k-Parity Constraints for the TSP
- Neural networks: computational models and applications.
- Exact algorithms for the equitable traveling salesman problem
- Generating good starting solutions for the \(p\)-median problem in the plane
- Sequential search and its application to vehicle-routing problems
- A novel bio-inspired approach based on the behavior of mosquitoes
- Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
This page was built for software: TSPLIB
