Experimental Methods for the Analysis of Optimization Algorithms
From MaRDI portal
Publication:3058164
DOI10.1007/978-3-642-02538-9zbMATH Open1203.68003OpenAlexW1625914768MaRDI QIDQ3058164FDOQ3058164
Author name not available (Why is that?)
Publication date: 18 November 2010
Full work available at URL: https://doi.org/10.1007/978-3-642-02538-9
Analysis of algorithms (68W40) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Mathematical programming (90C99)
Cited In (14)
- Automatic algorithm design for hybrid flowshop scheduling problems
- Microforecasting methods for fresh food supply chain management: a computational study
- An effective iterated tabu search for the maximum bisection problem
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- A model of anytime algorithm performance for bi-objective optimization
- Heuristic search to the capacitated clustering problem
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
- A survey of the standard location-routing problem
- Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives
- Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
- A survey of variants and extensions of the location-routing problem
- Time-series event-based prediction: an unsupervised learning framework based on genetic programming
Uses Software
This page was built for publication: Experimental Methods for the Analysis of Optimization Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058164)
