The following pages link to (Q4460278):
Displaying 29 items.
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
- An experimental comparison of some LLL-type lattice basis reduction algorithms (Q722627) (← links)
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions (Q725777) (← links)
- Cárnico-ICSPEA2--A metaheuristic co-evolutionary navigator for a complex co-evolutionary farming system (Q863978) (← links)
- A survey of the standard location-routing problem (Q1698292) (← links)
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times (Q1761212) (← links)
- Core instances for testing: a case study (Q1779532) (← links)
- An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method (Q1993591) (← links)
- Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search (Q2030591) (← links)
- Metaheuristics ``In the large'' (Q2242238) (← links)
- The optimization test environment (Q2357211) (← links)
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (Q2489308) (← links)
- Experimental analysis of approximation algorithms for the vertex cover and set covering problems (Q2496053) (← links)
- A simulated annealing algorithm for determining the thickness of a graph (Q2568255) (← links)
- A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
- Machine scheduling performance with maintenance and failure (Q2643755) (← links)
- A study on the pickup and delivery problem with time windows: matheuristics and new instances (Q2664415) (← links)
- A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times (Q2668670) (← links)
- Guidelines for the computational testing of machine learning approaches to vehicle routing problems (Q2670511) (← links)
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date (Q2676340) (← links)
- Towards a theory of practice in metaheuristics design: A machine learning perspective (Q3431446) (← links)
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO (Q5136083) (← links)
- A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems (Q5247673) (← links)
- Three Debates about Computing (Q5326387) (← links)
- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis (Q5452148) (← links)
- COCO: a platform for comparing continuous optimizers in a black-box setting (Q5859012) (← links)
- Educational timetabling: problems, benchmarks, and state-of-the-art results (Q6167390) (← links)
- Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion (Q6551067) (← links)
- Finding the \(k\) shortest simple paths: time and space trade-offs (Q6579778) (← links)
