The following pages link to CPU Benchmarks (Q5973305):
Displayed 17 items.
- On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations (Q280157) (← links)
- An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
- A biased random-key genetic algorithm for the maximum quasi-clique problem (Q1653365) (← links)
- Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
- Efficiently solving very large-scale routing problems (Q1738815) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints (Q2184054) (← links)
- A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing (Q2301940) (← links)
- An adaptive discretization algorithm for the design of water usage and treatment networks (Q2331361) (← links)
- MineReduce: an approach based on data mining for problem size reduction (Q2664324) (← links)
- A progressive filtering heuristic for the location-routing problem and variants (Q2668599) (← links)
- A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts (Q2669559) (← links)
- New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795) (← links)
- Guidelines for the computational testing of machine learning approaches to vehicle routing problems (Q2670511) (← links)
- Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)
- An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem (Q5084630) (← links)
- Stalling for solving slow server problem (Q5244288) (← links)