Cited in
(29)- A progressive filtering heuristic for the location-routing problem and variants
- A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts
- Guidelines for the computational testing of machine learning approaches to vehicle routing problems
- A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
- Improved Computational Approaches and Heuristics for Zero Forcing
- MineReduce: an approach based on data mining for problem size reduction
- On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations
- Cvrplib
- Knowledge-guided local search for the vehicle routing problem
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
- An effective heuristic algorithm for the partial shop scheduling problem
- GridSim
- irace
- BHOSLIB
- TTTPLOTS
- OptorSim
- GTSP Instances Library
- cumulativemm
- gprecedencemm
- An adaptive discretization algorithm for the design of water usage and treatment networks
- POPMUSIC
- GTSP-LIB
- Stalling for solving slow server problem
- Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints
- HGS-CVRP
- Efficiently solving very large-scale routing problems
- New formulations and branch-and-cut procedures for the longest induced path problem
This page was built for software: CPU Benchmarks
