Pages that link to "Item:Q1290162"
From MaRDI portal
The following pages link to Landscapes, operators and heuristic search (Q1290162):
Displaying 28 items.
- Breakout local search for maximum clique problems (Q339563) (← links)
- Discovering the suitability of optimisation algorithms by learning from evolved instances (Q408979) (← links)
- Fitness landscape analysis for the no-wait flow-shop scheduling problem (Q519086) (← links)
- On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification (Q613434) (← links)
- Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
- On operators and search space topology in multi-objective flow shop scheduling (Q872256) (← links)
- A review of metrics on permutations for search landscape analysis (Q878593) (← links)
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers (Q947958) (← links)
- Backbone analysis and algorithm design for the quadratic assignment problem (Q954381) (← links)
- How to escape local optima in black box optimisation: when non-elitism outperforms elitism (Q1750360) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- HC\_AB: a new heuristic clustering algorithm based on approximate backbone (Q1944152) (← links)
- A metaheuristic for the delivery man problem with time windows (Q2045024) (← links)
- An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
- Memetic algorithms outperform evolutionary algorithms in multimodal optimisation (Q2211864) (← links)
- Local search-based hybrid algorithms for finding Golomb rulers (Q2385176) (← links)
- Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem (Q2482999) (← links)
- Predatory search algorithm with restriction of solution distance (Q2500224) (← links)
- Iterated local search for the quadratic assignment problem (Q2503224) (← links)
- Some aspects of scatter search in the flow-shop problem (Q2570162) (← links)
- New insights on neutral binary representations for evolutionary optimization (Q2628777) (← links)
- Variable neighborhood search for integrated timetable based design of railway infrastructure (Q2631246) (← links)
- Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial (Q2661994) (← links)
- Why operator-induced neighborhoods are a bad idea (Q2994898) (← links)
- An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers (Q3596695) (← links)
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem (Q5946533) (← links)
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions (Q6056893) (← links)
- Stochastic local search and parameters recommendation: a case study on flowshop problems (Q6079864) (← links)
