TSPLIB
From MaRDI portal
swMATH983MaRDI QIDQ13727FDOQ13727
Author name not available (Why is that?)
Official website: http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/
Cited In (only showing first 100 items - show all)
- MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- CAGE
- GLOB
- LEDA
- MALLBA
- Title not available (Why is that?)
- QAPLIB
- GRASP
- Title not available (Why is that?)
- Title not available (Why is that?)
- BIANCA
- OGDF
- BoneRoute
- Algorithm 781
- MINTO
- ASA
- Genocop
- Blossom V
- Blossom IV
- Concorde
- CirCut
- Knapsack
- LKH
- JOBSHOP
- LocalSolver
- QSopt
- PORTA
- Algorithm 864
- PGAPack
- TSPTW
- SYMPHONY
- LEMON
- TSP software
- MCF
- Scatter Search
- TSPAntSim
- PIGALE
- VRP
- AutoGraphiX
- MACS-VRPTW
- GATE
- SPOT
- DREAM
- HeuristicLab
- JDeal
- PMF
- Scarab
- MineLib
- MENU-OKF
- MOD-DIST
- PLplot
- SITATION
- RngSteam
- BEAMR
- MATEDA
- irace
- BHOSLIB
- DIMACS
- TTTPLOTS
- PhySIC
- MOPS
- Tabu search
- bc-prod
- VRPLIB
- apcluster
- APCluster
- LinTim
- SONET
- ROPI
- MIRPLib
- Beam-ACO
- AntNet
- Tttplots-compare
- COIN/BCP
- DPRml
- OsiSolver
- LOLIB
- CVRPSP
- Kangaroo
- MODEVO
- ShapePheno
- sasplp.m
- GTSP Instances Library
- SIPI Image Database
- GRAPPA
- MEALS
- Bison
- AlgDesign
- MineLib: a library of open pit mining problems
- A library of local search heuristics for the vehicle routing problem
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Combinatorial optimization and small polytopes
- COOBBO: a novel opposition-based soft computing algorithm for TSP problems
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- The multiagent planning problem
- Chained Lin-Kernighan for large traveling salesman problems
This page was built for software: TSPLIB
