Pages that link to "Item:Q857808"
From MaRDI portal
The following pages link to Analyzing the complexity of finding good neighborhood functions for local search algorithms (Q857808):
Displaying 6 items.
- Studying the complexity of global verification for NP-hard discrete optimization problems (Q1402543) (← links)
- An experimental analysis of local minima to improve neighbourhood search. (Q1422374) (← links)
- Data-independent neighborhood functions and strict local optima (Q1763477) (← links)
- Polynomial transformations and data-independent neighborhood functions (Q1887061) (← links)
- An analysis of neighborhood functions on generic solution spaces (Q2462147) (← links)
- Order preserving reductions and polynomial improving paths (Q2583701) (← links)