Combinations of local search and exact algorithms
From MaRDI portal
Recommendations
- A local search template.
- Local Search and Constraint Programming
- Local search algorithms for combinatorial problems. Analysis, improvements, and new applications (Thesis TU Darmstadt 1998)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
Cited in
(12)- On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
- Hybridizing exact methods and metaheuristics: a taxonomy
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- A matheuristic for the driver scheduling problem with staff cars
- Combining the scalability of local search with the pruning techniques of systematic search
- A comparative analysis of two matheuristics by means of merged local optima networks
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- Approximate Local Search in Combinatorial Optimization
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Solving the edge‐disjoint paths problem using a two‐stage method
This page was built for publication: Combinations of local search and exact algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418381)
