Cited in
(only showing first 100 items - show all)- Computational study on a PTAS for planar dominating set problem
- Efficiently solving very large-scale routing problems
- Models for the single-vehicle preemptive pickup and delivery problem
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
- Modeling and solving the angular constrained minimum spanning tree problem
- Minimizing dispersion in multiple drone routing
- scientific article; zbMATH DE number 2156295 (Why is no real title available?)
- Linear programs for constraint satisfaction problems
- Optimal partitioning of a data set based on the \(p\)-median model
- Solving the Orienteering Problem through Branch-and-Cut
- A comparative analysis of several asymmetric traveling salesman problem formulations
- An iterated local search for the traveling salesman problem with release dates and completion time minimization
- The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms
- The min-cost parallel drone scheduling vehicle routing problem
- GENI ants for the traveling salesman problem
- A new approach to solve the classical symmetric traveling salesman problem by zero suffix method
- The generalized quadratic knapsack problem. A neuronal network approach
- A review of Hopfield neural networks for solving mathematical programming problems
- Optimal TSP tour length estimation using standard deviation as a predictor
- A Lower Bound for the Split Delivery Vehicle Routing Problem
- The traveling salesman problem: a deterministic algorithm using tabu search
- The \(p\)-median problem: a survey of metaheuristic approaches
- Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP
- A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
- Finding the right cutting planes for the TSP
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
- New heuristic algorithms for the windy rural postman problem
- A matheuristic approach to the orienteering problem with service time dependent profits
- Analysis of a high-performance TSP solver on the GPU
- Variable neighborhood search for harmonic means clustering
- Computational Study on Dominating Set Problem of Planar Graphs
- An empirical study on randomized optimal area polygonization of planar point sets
- A hybrid optimization approach for the Steiner k-connected network design problem
- Minimizing customers' waiting time in a vehicle routing problem with unit demands
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- Heuristics for the traveling repairman problem with profits
- An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- Variable neighbourhood search: Methods and applications
- Locating a cycle in a transportation or a telecommunications network
- Can the agent with limited information solve travelling salesman problem?
- Using Markov chains to analyze the effectiveness of local search algorithms
- Attraction probabilities in variable neighborhood search
- Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem
- How efficient is a global constraint in practice? A fair experimental framework
- Solving very sparse rational systems of equations
- Survivability in hierarchical telecommunications networks
- An improved approximation scheme for the Group Steiner Problem
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
- Genetic algorithms and traveling salesman problems
- A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
- Constructing test functions for global optimization using continuous formulations of graph problems
- Generalization of the restricted planar location problems: unified metaheuristic algorithms
- Exponential neighbourhood local search for the traveling salesman problem
- Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
- The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms
- Polyhedral techniques in combinatorial optimization II: applications and computations
- Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
- Parallelization strategies for rollout algorithms
- scientific article; zbMATH DE number 1749222 (Why is no real title available?)
- An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
- A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem
- Parallel metaheuristics: recent advances and new trends
- Two-stage nested partitions method for stochastic optimization
- The complete vertex \(p\)-center problem
- An approximative lexicographic MIN-MAX approach to the discrete facility location problem
- Variable neighborhood search: Principles and applications
- Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
- scientific article; zbMATH DE number 1163704 (Why is no real title available?)
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
- Genetic local search for multi-objective combinatorial optimization
- Union search: a new meta-heuristic algorithm to the traveling salesman problem
- The influence of problem specific neighborhood structures in metaheuristics performance
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem
- Logistics planning of cash transfer to Syrian refugees in Turkey
- Algorithms and experiments: The new (and old) methodology
- A hybrid data mining metaheuristic for the p‐median problem
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
- Multi-criteria optimization for last mile distribution of disaster relief aid: test cases and applications
- On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain
- Local search inequalities
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- A gene-pool based genetic algorithm for TSP
- Approximation Algorithms for the Black and White Traveling Salesman Problem
- Variable neighbourhood search: methods and applications
- Two-phase Pareto local search for the biobjective traveling salesman problem
- A location-routing problem in glass recycling
- Implications, conflicts, and reductions for Steiner trees
- Heuristiques pour le Problème du Vendeurm-Péripatétique
- Canonical dual approach to solving the maximum cut problem
- A survey of very large-scale neighborhood search techniques
- scientific article; zbMATH DE number 1881096 (Why is no real title available?)
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Computing with domino-parity inequalities for the traveling salesman problem (TSP)
- Speed-up techniques for solving large-scale biobjective TSP
- A modified genetic algorithm-based approach to solve constrained solid TSP with time window using interval valued parameter
- A new heuristic for solving the \(p\)-median problem in the plane
This page was built for software: TSPLIB
