scientific article; zbMATH DE number 2065615
From MaRDI portal
Publication:4460278
zbMath1103.68997MaRDI QIDQ4460278
Publication date: 18 May 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (27)
On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem ⋮ A survey of variants and extensions of the location-routing problem ⋮ Machine scheduling performance with maintenance and failure ⋮ Cárnico-ICSPEA2--A metaheuristic co-evolutionary navigator for a complex co-evolutionary farming system ⋮ Three Debates about Computing ⋮ A study on the pickup and delivery problem with time windows: matheuristics and new instances ⋮ A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times ⋮ Guidelines for the computational testing of machine learning approaches to vehicle routing problems ⋮ Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date ⋮ A linear constrained optimization Benchmark for probabilistic search algorithms: the rotated Klee-Minty problem ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ A survey of the standard location-routing problem ⋮ What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO ⋮ Metaheuristics ``In the large ⋮ An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method ⋮ An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times ⋮ Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem ⋮ Experimental analysis of approximation algorithms for the vertex cover and set covering problems ⋮ Core instances for testing: a case study ⋮ An experimental comparison of some LLL-type lattice basis reduction algorithms ⋮ Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search ⋮ An evaluation of low-cost heuristics for matrix bandwidth and profile reductions ⋮ A simulated annealing algorithm for determining the thickness of a graph ⋮ A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems ⋮ Towards a theory of practice in metaheuristics design: A machine learning perspective ⋮ COCO: a platform for comparing continuous optimizers in a black-box setting ⋮ The optimization test environment
Uses Software
This page was built for publication:
