Cited in
(84)- Heuristics for the constrained incremental graph drawing problem
- Making a state-of-the-art heuristic faster with data mining
- TTT plots: a perl program to create time-to-target plots
- Designing vehicle routes for a mix of different request types, under time windows and loading constraints
- A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows
- Tabu search and GRASP for the capacitated clustering problem
- Exploring grid implementations of parallel cooperative metaheuristics
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
- A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow
- Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm
- A hybrid data mining metaheuristic for the p‐median problem
- Tabu search versus GRASP for the maximum diversity problem
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
- CPU Benchmarks
- Intelligent-guided adaptive search for the maximum covering location problem
- Adaptive memory in multistart heuristics for multicommodity network design
- A biased random-key genetic algorithm for the Steiner triple covering problem
- A mesh adaptive basin hopping method for the design of circular antenna arrays
- An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
- Heuristic search to the capacitated clustering problem
- GRASP
- PERL
- J-MEANS
- GRASP_QAP
- COPRIN
- Scatter Search
- SpeeDP
- A general VNS heuristic for the traveling salesman problem with time windows
- SDP_S
- irace
- BHOSLIB
- Tabu search
- ChainSAT
- Tttplots-compare
- Grid BnB
- Algorithm 815
- Algorithm 797
- Algorithm 787
- Sparrow2011
- Algorithm 769
- CUTGEN1
- SAcb
- TScb
- Variable neighborhood descent with iterated local search for routing and wavelength assignment
- \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
- CCLS
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
- A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty
- Clonal selection: an immunological algorithm for global optimization over continuous spaces
- An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints
- HGS-CVRP
- Heuristics for the generalized median graph problem
- An improved configuration checking-based algorithm for the unicost set covering problem
- A nonmonotone GRASP
- Path relinking for unconstrained binary quadratic programming
- A hybrid data mining GRASP with path-relinking
- A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
- An iterated sample construction with path relinking method: application to switch allocation in electrical distribution networks
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
- Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters
- A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution
- GRASP with path-relinking for the generalized quadratic assignment problem
- Heuristics and matheuristics for a real-life machine reassignment problem
- Models and heuristics for the \(k\)-degree constrained minimum spanning tree problem with node-degree costs
- MineReduce: an approach based on data mining for problem size reduction
- Extending time-to-target plots to multiple instances
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems
- Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem
- Hybrid algorithms for placement of virtual machines across geo-separated data centers
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
- Parallel hybrid heuristics for the permutation flow shop problem
- Using sequential runtime distributions for the parallel speedup prediction of SAT local search
- Large-scale parallelism for constraint-based local search: the costas array case study
- GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- Reinforcement learning based tabu search for the minimum load coloring problem
This page was built for software: TTTPLOTS
