Local search heuristics for combinatorial optimization problems
From MaRDI portal
Recommendations
Cited in
(15)- Local search heuristics for multi-index assignment problems with decomposable costs
- Theoretical aspects of local search.
- A new approach to choosing initial points in local search
- Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
- Local search heuristics for the multidimensional assignment problem
- On local search based heuristics for optimization problems
- A unified modeling and solution framework for combinatorial optimization problems
- scientific article; zbMATH DE number 151868 (Why is no real title available?)
- Approximate Local Search in Combinatorial Optimization
- Structural analysis of local search heuristics in combinatorial optimization
- On the usefulness of accessibility graphs with combinatorial optimization problems
- Morph-based local-search heuristics for large-scale combinatorial data analysis
- Paroid search: Generic local combinatorial optimization
- Metaheuristic downhill simplex method in combinatorial optimization
- Simple Local Search Problems that are Hard to Solve
This page was built for publication: Local search heuristics for combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3367576)
