Pages that link to "Item:Q3058164"
From MaRDI portal
The following pages link to Experimental Methods for the Analysis of Optimization Algorithms (Q3058164):
Displaying 14 items.
- A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
- Time-series event-based prediction: an unsupervised learning framework based on genetic programming (Q528734) (← links)
- Heuristic search to the capacitated clustering problem (Q1622798) (← links)
- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188) (← links)
- An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
- A survey of the standard location-routing problem (Q1698292) (← links)
- Microforecasting methods for fresh food supply chain management: a computational study (Q1997065) (← links)
- A model of anytime algorithm performance for bi-objective optimization (Q2022237) (← links)
- Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach (Q2080825) (← links)
- An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
- Automatic algorithm design for hybrid flowshop scheduling problems (Q2286868) (← links)
- A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (Q2629710) (← links)
- Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives (Q5153496) (← links)
