The following pages link to Mechanisms for local search (Q1266572):
Displaying 11 items.
- A survey for the quadratic assignment problem (Q852928) (← links)
- A new approach to choosing initial points in local search (Q1116345) (← links)
- The depth and width of local minima in discrete solution spaces (Q1343158) (← links)
- A computational study of several relocation methods for \(k\)-means algorithms. (Q1425990) (← links)
- Some computational issues in cluster analysis with no a priori metric (Q1960467) (← links)
- The component model for elementary landscapes and partial neighborhoods (Q2250997) (← links)
- Local-search extraction of mUSes (Q2385174) (← links)
- Commonalities in local search (Q2711197) (← links)
- Efficiency of local search with multiple local optima (Q2784507) (← links)
- Efficient Multi-Start Strategies for Local Search Algorithms (Q3087026) (← links)
- Efficiency of Local Search (Q5756557) (← links)