CPU Benchmarks

swMATH41536MaRDI QIDQ5973305FDOQ5973305

Author name not available (Why is that?)

Cited In (17)

• Knowledge-guided local search for the vehicle routing problem
• Stalling for solving slow server problem
• Efficiently solving very large-scale routing problems
• Improved Computational Approaches and Heuristics for Zero Forcing
• On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations
• A biased random-key genetic algorithm for the maximum quasi-clique problem
• Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
• Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints
• An effective heuristic algorithm for the partial shop scheduling problem
• An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
• An adaptive discretization algorithm for the design of water usage and treatment networks
• MineReduce: an approach based on data mining for problem size reduction
• 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
• New formulations and branch-and-cut procedures for the longest induced path problem
• A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing

This page was built for software: CPU Benchmarks