TSPLIB—A Traveling Salesman Problem Library
From MaRDI portal
Publication:4015422
DOI10.1287/ijoc.3.4.376zbMath0775.90293OpenAlexW2163428398WikidataQ59760363 ScholiaQ59760363MaRDI QIDQ4015422
Publication date: 11 February 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.3.4.376
Related Items
Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems, Exact algorithms for the minimum latency problem, Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems, A decomposition based estimation of distribution algorithm for multiobjective traveling salesman problems, The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm, The traveling salesman problem with time-dependent service times, A branch-and-cut framework for the consistent traveling salesman problem, MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem, Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem, \(p\)-facility Huff location problem on networks, Orienteering problem: a survey of recent variants, solution approaches and applications, New analysis and computational study for the planar connected dominating set problem, Solving the \(p\)-median problem with a semi-Lagrangian relaxation, Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, Double bound method for solving the \(p\)-center location problem, Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services, Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations, Variable neighborhood search for the pharmacy duty scheduling problem, Two level general variable neighborhood search for attractive traveling salesman problem, An iterated local search heuristic for the split delivery vehicle routing problem, Model-based automatic neighborhood design by unsupervised learning, Local search heuristics for the mobile facility location problem, New heuristic algorithms for solving the planar \(p\)-median problem, A new heuristic for solving the \(p\)-median problem in the plane, Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem, Design of survivable IP-over-optical networks, The \(p\)-median problem: a survey of metaheuristic approaches, An immune memory clonal algorithm for numerical and combinatorial optimization, Application of the cross-entropy method to clustering and vector quantization, MineLib: a library of open pit mining problems, Multi-depot multiple TSP: a polyhedral study and computational results, Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions, Evolutionary self-adaptation: a survey of operators and strategy parameters, A heuristic procedure for the capacitated \(m\)-ring-star problem, Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches, Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem, Practical algorithms for branch-decompositions of planar graphs, Traveling salesman problem heuristics: leading methods, implementations and latest advances, Models for the single-vehicle preemptive pickup and delivery problem, The tree representation for the pickup and delivery traveling salesman problem with LIFO loading, The delivery man problem with time windows, Using Markov chains to analyze the effectiveness of local search algorithms, On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain, Partitioning planar graphs: a fast combinatorial approach for max-cut, Complexity evaluation of benchmark instances for the \(p\)-median problem, Variable neighborhood search for harmonic means clustering, An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem, A binary particle swarm optimization algorithm inspired by multi-level organizational learning behavior, Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem, The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm, Approximating the metric TSP in linear time, Seeking global edges for traveling salesman problem in multi-start search, Comparing different metaheuristic approaches for the median path problem with bounded length, An approximation algorithm for network design problems with downwards-monotone demand functions, Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem, A tabu search heuristic for the generalized minimum spanning tree problem, An improved column generation algorithm for minimum sum-of-squares clustering, An iterated local search for the budget constrained generalized maximal covering location problem, Single-facility huff location problems on networks, Exterior point simplex-type algorithms for linear and network optimization problems, Improving genetic algorithm with fine-tuned crossover and scaled architecture, A discrete gravitational search algorithm for solving combinatorial optimization problems, Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm, A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs, Design of hybrids for the minimum sum-of-squares clustering problem, New local searches for solving the multi-source Weber problem, Multiple depot ring star problem: a polyhedral study and an exact algorithm, An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits, Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem, A comparative analysis of several asymmetric traveling salesman problem formulations, A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand, Rank aggregation in cyclic sequences, Solving combinatorial optimization problems using augmented Lagrange chaotic simulated annealing, Canonical dual approach to solving the maximum cut problem, Symmetric weight constrained traveling salesman problem: Local search, A memetic algorithm for the generalized traveling salesman problem, Genetic algorithm for combinatorial path planning: the subtour problem, Computing compatible tours for the symmetric traveling salesman problem, Variable neighbourhood search: methods and applications, A framework for analyzing sub-optimal performance of local search algorithms, Two-phase Pareto local search for the biobjective traveling salesman problem, The effective application of a new approach to the generalized orienteering problem, The neighbor-net algorithm, A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem, Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems, A library of local search heuristics for the vehicle routing problem, On the domino-parity inequalities for the STSP, Solving the family traveling salesman problem, Strong multi-commodity flow formulations for the asymmetric traveling salesman problem, Global versus local search: the impact of population sizes on evolutionary algorithm performance, A hyperbolic smoothing approach to the multisource Weber problem, TSPLIB, Efficiently solving the traveling thief problem using hill climbing and simulated annealing, Parallelization strategies for rollout algorithms, Performance analysis of cyclical simulated annealing algorithms, A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms, Enhancements to two exact algorithms for solving the vertex \(P\)-center problem, Metaheuristic applications on discrete facility location problems: a survey, An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem, Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem, Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem, Solving the continuous multiple allocationp-hub median problem by the hyperbolic smoothing approach, Length-constrained cycle partition with an application to UAV routing*, Approximating the Metric TSP in Linear Time, Improving the Exploration Ability of Ant-Based Algorithms, Solving the asymmetric traveling salesman problem with periodic constraints, An algorithm for minimizing clustering functions, Design of Survivable Networks: A survey, The orienteering problem with variable profits, A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program, Analysis of a High-Performance TSP Solver on the GPU, Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments, Sequencing of parts on single-stage multifunctional machining systems using a chaos-embedded simulated annealing algorithm, Continuous cutting plane algorithms in integer programming, Area-Optimal Simple Polygonalizations: The CG Challenge 2019, Safe and secure vehicle routing: a survey on minimization of risk exposure, Optimization bounds from decision diagrams in Haddock, Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule, A learn‐and‐construct framework for general mixed‐integer programming problems, The intermittent travelling salesman problem, A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem, An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions, Heuristic approaches for the family traveling salesman problem, An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search, Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND, Solving the clustered traveling salesman problem with ‐relaxed priority rule, Exact models for the flying sidekick traveling salesman problem, A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints, A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem, The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp>, Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures, New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems, Precedence-constrained arborescences, On the initialization methods of an exterior point algorithm for the assignment problem, A branch-and-cut algorithm for the balanced traveling salesman problem, Fairer comparisons for travelling salesman problem solutions using hash functions, A Branch Decomposition Algorithm for the p-Median Problem, Applying topological data analysis to local search problems, A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem, Column Generation Algorithms for the Capacitated m-Ring-Star Problem, Mixed-integer programming techniques for the minimum sum-of-squares clustering problem, An efficient Benders decomposition for the \(p\)-median problem, On the generation of metric TSP instances with a large integrality gap by branch-and-cut, New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule, EETTlib—Energy‐efficient train timetabling library, Node based compact formulations for the Hamiltonian p‐median problem, Exact solution approaches for the discrete α‐neighbor p‐center problem, A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group, Generalized nash fairness solutions for bi‐objective minimization problems, An oracle-based framework for robust combinatorial optimization, The capacitated family traveling salesperson problem, Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility, Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems, Unnamed Item, Unnamed Item, Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane, Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams, Visiting near-optimal solutions using local search algorithms, Coarse-Graining Large Search Landscapes Using Massive Edge Collapse, Unnamed Item, Clustering and multifacility location with constraints via distance function penalty methods and dc programming, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, Constructing test functions for global optimization using continuous formulations of graph problems, Parallel metaheuristics: recent advances and new trends, Branch and cut methods for network optimization, Variable neighborhood search: Principles and applications, ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS, From symmetry to asymmetry: generalizing TSP approximations by parametrization, Locating a cycle in a transportation or a telecommunications network, The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization, A software framework for fast prototyping of meta‐heuristics hybridization, A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem, The noising methods: A generalization of some metaheuristics, Solving thep-Center problem with Tabu Search and Variable Neighborhood Search, Genetic local search for multi-objective combinatorial optimization, J-MEANS: A new local search heuristic for minimum sum of squares clustering, Affinity propagation and uncapacitated facility location problems, Provably good solutions for the traveling salesman problem, Heuristiques pour le Problème du Vendeurm-Péripatétique, Dynamic selective pressure using hybrid evolutionary and ant system strategies for structural optimization, Experiments on the minimum linear arrangement problem, Implications, conflicts, and reductions for Steiner trees, Unnamed Item, New Rollout Algorithms for Combinatorial Optimization Problems, A hybrid data mining metaheuristic for the p‐median problem, Improved starting solutions for the planar p-median problem, The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm, Randomized heuristics for the family traveling salesperson problem, Continuous reformulations and heuristics for the Euclidean travelling salesperson problem, Self-tuning of the noising methods, Using injection points in reformulation local search for solving continuous location problems, The Ring Star Problem: Polyhedral analysis and exact algorithm, Prize-Collecting TSP with a Budget Constraint, On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm, Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding, A fast optimization method based on a hierarchical strategy for the travelling salesman problem, A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem, Embedded local search approaches for routing optimization, Data structures and ejection chains for solving large-scale traveling salesman problems, Locating median cycles in networks, The time constrained maximal covering salesman problem, Visual attractiveness in routing problems: a review, Making a state-of-the-art heuristic faster with data mining, A distance-limited continuous location-allocation problem for spatial planning of decentralized systems, An iterated local search for the traveling salesman problem with release dates and completion time minimization, A VNS approach to multi-location inventory redistribution with vehicle routing, Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem, MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration, A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment, An efficient evolutionary algorithm for the orienteering problem, Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading, Integer programming models and linearizations for the traveling car renter problem, Generalization of the restricted planar location problems: unified metaheuristic algorithms, Routing problems: A bibliography, A hybrid approach for biobjective optimization, Combining simulated annealing with local search heuristics, A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls, Designing and reporting on computational experiments with heuristic methods, A general variable neighborhood search variants for the travelling salesman problem with draft limits, The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach, An exact algorithm for the minimum dilation triangulation problem, A simple and effective metaheuristic for the minimum latency problem, Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints, Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem, A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem, A bound for the symmetric travelling salesman problem through matroid formulation, Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms, The TSP phase transition, Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem, Computing the variance of tour costs over the solution space of the TSP in polynomial time, Transformations of generalized ATSP into ATSP., Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme, How efficient is a global constraint in practice? A fair experimental framework, Variable neighborhood search: basics and variants, Algorithms and codes for dense assignment problems: The state of the art, A new adaptive Hungarian mating scheme in genetic algorithms, Solving the traveling salesman problem with interdiction and fortification, Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches, Computational study on a PTAS for planar dominating set problem, Application of imperialist competitive algorithm on solving the traveling salesman problem, COOBBO: a novel opposition-based soft computing algorithm for TSP problems, Efficiently solving very large-scale routing problems, Minimizing customers' waiting time in a vehicle routing problem with unit demands, Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization, Mileage bands in freight transportation, Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering, Multi-criteria optimization for last mile distribution of disaster relief aid: test cases and applications, Bee-inspired algorithms applied to vehicle routing problems: a survey and a proposal, Local search inequalities, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, The packing while traveling problem, The pickup and delivery traveling salesman problem with handling costs, New benchmark instances for the capacitated vehicle routing problem, Identification of unidentified equality constraints for integer programming problems, A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique, A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem, Minimizing dispersion in multiple drone routing, An integer programming-based local search for the covering salesman problem, Lower tolerance-based branch and bound algorithms for the ATSP, The multiagent planning problem, A heuristic algorithm for solving the minimum sum-of-squares clustering problems, Attraction probabilities in variable neighborhood search, Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows, Candidate groups search for K-harmonic means data clustering, The pickup and delivery traveling salesman problem with first-in-first-out loading, The conditional \(p\)-dispersion problem, Cluster based branching for the asymmetric traveling salesman problem, Guided local search and its application to the traveling salesman problem, Algorithms for the metric ring star problem with fixed edge-cost ratio, A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks, Genetic algorithms and traveling salesman problems, Combinatorial optimization and small polytopes, Stability aspects of the traveling salesman problem based on \(k\)-best solutions, Combined location-routing problems -- a neural network approach, Variable neighbourhood search: Methods and applications, Finding the maximum multi improvement on neighborhood exploration, A parallel variable neighborhood search for solving covering salesman problem, A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak, Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem, Stronger \(K\)-tree relaxations for the vehicle routing problem, A heuristic for the pickup and delivery traveling salesman problem, Speed-up techniques for solving large-scale biobjective TSP, Computational study on planar dominating set problem, A review of Hopfield neural networks for solving mathematical programming problems, The attractive traveling salesman problem, Heuristic algorithms for the multi-depot ring-star problem, Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Application of the noising method to the travelling salesman problem, An efficient composite heuristic for the symmetric generalized traveling salesman problem, An effective implementation of the Lin-Kernighan traveling salesman heuristic, Fuzzy J-means: a new heuristic for fuzzy clustering, Perturbation heuristics for the pickup and delivery traveling salesman problem, Relaxed tours and path ejections for the traveling salesman problem, Separating capacity constraints in the CVRP using tabu search, Survivability in hierarchical telecommunications networks, Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday), From symmetry to asymmetry: generalizing TSP approximations by parametrization, A mixed breadth-depth first strategy for the branch and bound tree of Euclidean \(k\)-center problems, Particle swarm optimization-based algorithms for TSP and generalized TSP, Exact algorithms for budgeted prize-collecting covering subgraph problems, A two-level off-grid electric distribution problem on the continuous space, Genetic operators for combinatorial optimization in TSP and microarray gene ordering, Good triangulations yield good tours, New heuristic algorithms for the windy rural postman problem, PackLib\(^{2}\): an integrated library of multi-dimensional packing problems, A survey of truck-drone routing problem: literature review and research prospects, Matheuristic algorithms for the parallel drone scheduling traveling salesman problem, Vehicle routing for milk collection with gradual blending: a case arising in Chile, Penalty weights in QUBO formulations: permutation problems, The hyperbolic smoothing clustering method, The simultaneous semi-random model for TSP, Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems, Metaheuristics and cooperative approaches for the bi-objective ring star problem, The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems, Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem, Improving the robustness of EPS to solve the TSP, Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows, Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem, The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands, Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms, Optimization for drone and drone-truck combined operations: a review of the state of the art and future directions, A hybrid adaptive large neighborhood search heuristic for the team orienteering problem, An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem, Biologically inspired parent selection in genetic algorithms, Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach, The traveling salesman problem with job-times (\textit{TSPJ}), A weighted-sum method for solving the bi-objective traveling thief problem, The min-cost parallel drone scheduling vehicle routing problem, A transformation technique for the clustered generalized traveling salesman problem with applications to logistics, Finding the largest triangle in a graph in expected quadratic time, A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem, A voltage drop limited decentralized electric power distribution network, Optimal TSP tour length estimation using standard deviation as a predictor, Multiple \(k\)-opt evaluation multiple \(k\)-opt moves with GPU high performance local search to large-scale traveling salesman problems, Dynamic graph conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem, Survivability in Hierarchical Telecommunications Networks Under Dual Homing, A simple model for the multiple traveling salesmen problem with single depot and multiple sink, A study on the effects of normalized TSP features for automated algorithm selection, Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP, Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem, Incremental beam search, Computing Euclidean Steiner trees over segments, The complete vertex \(p\)-center problem, An edge-swap heuristic for generating spanning trees with minimum number of branch vertices, A Heuristic Approach for Cluster TSP, Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem, Self-organizing maps in evolutionary approach for the traveling salesman problem and vehicle routing problem with time windows, The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms, On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms, Mixed-integer programming approaches for the time-constrained maximal covering routing problem, Generalization of machine learning for problem reduction: a case study on travelling salesman problems, Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art, An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms, The undirected \(m\)-capacitated peripatetic salesman problem, A fast swap-based local search procedure for location problems, A new local search for continuous location problems, Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints, MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results, Tolerance-based branch and bound algorithms for the ATSP, Determination of the candidate arc set for the asymmetric traveling salesman problem, A scatter search approach for the minimum sum-of-squares clustering problem, A location-routing problem in glass recycling, Sequential search and its application to vehicle-routing problems, First vs. best improvement: an empirical study, A comparison of two different formulations for arc routing problems on mixed graphs, A Neural-Network-Based Approach to the Double Traveling Salesman Problem, A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem, The balanced billing cycle vehicle routing problem, The generalized quadratic knapsack problem. A neuronal network approach, A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff, Models and algorithms for the traveling salesman problem with time-dependent service times, Continuous relaxations for the traveling salesman problem, Nonoblivious 2-Opt heuristics for the traveling salesman problem, The Generalized Covering Salesman Problem, A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP, Anytime pack search, A covering traveling salesman problem with profit in the last mile delivery, Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem, Upper and lower bounding procedures for the minimum caterpillar spanning problem, A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem, Generating good starting solutions for the p-median problem in the plane, Dynamic traveling salesman problem with stochastic release dates, Modeling and solving the angular constrained minimum spanning tree problem, Cuts for mixed 0-1 conic programming, Implementation analysis of efficient heuristic algorithms for the traveling salesman problem, The influence of problem specific neighborhood structures in metaheuristics performance, An incremental clustering algorithm based on hyperbolic smoothing, Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation, Solving the traveling delivery person problem with limited computational time, A branch-and-price approach for the continuous multifacility monotone ordered median problem, Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants, Learning to sparsify travelling salesman problem instances, An effective PSO-inspired algorithm for the team orienteering problem, An efficient evolutionary algorithm for the ring star problem
