The following pages link to (Q4667330):
Displaying 13 items.
- \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
- An evolutionary method for complex-process optimization (Q732898) (← links)
- Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064) (← links)
- Classification of applied methods of combinatorial optimization (Q844352) (← links)
- Genetic algorithms and tabu search: Hybrids for optimization (Q1342325) (← links)
- On the performance of scatter search for post-enrolment course timetabling problems (Q2015784) (← links)
- A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem (Q2116840) (← links)
- Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
- Principles of scatter search (Q2570141) (← links)
- Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies (Q2570147) (← links)
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions (Q2583180) (← links)
- Fundamentals of scatter search and path relinking (Q2731676) (← links)
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking (Q5139848) (← links)
