Pages that link to "Item:Q5429289"
From MaRDI portal
The following pages link to Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (Q5429289):
Displaying 13 items.
- Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions (Q5429290) (← links)
- Mixed Models for the Analysis of Local Search Components (Q5429291) (← links)
- An Algorithm Portfolio for the Sub-graph Isomorphism Problem (Q5429292) (← links)
- A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem (Q5429295) (← links)
- Probabilistic Beam Search for the Longest Common Subsequence Problem (Q5429296) (← links)
- A Bidirectional Greedy Heuristic for the Subspace Selection Problem (Q5429297) (← links)
- Solving a Bi-objective Vehicle Routing Problem by Pareto-Ant Colony Optimization (Q5429298) (← links)
- A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route (Q5429299) (← links)
- A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem (Q5429300) (← links)
- Local Search in Complex Scheduling Problems (Q5429301) (← links)
- A Multi-sphere Scheme for 2D and 3D Packing Problems (Q5429302) (← links)
- Formulation Space Search for Circle Packing Problems (Q5429303) (← links)
- Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming (Q5429304) (← links)