Finding optimal solutions to several gray pattern instances
From MaRDI portal
(Redirected from Publication:2115324)
Recommendations
- Optimal solutions to pattern matching problems
- Finding a cluster of points and the grey pattern quadratic assignment problem
- Exact algorithms for the solution of the grey pattern quadratic assignment problem
- Optimization by pattern search
- Finding a solution to an optimization problem and an application
- Greedy search of optimal approximate solutions
- scientific article; zbMATH DE number 3993300
- Multiple optimal solutions to a sort of nonlinear optimization problem
- Pattern search methods for finite minimax problems
- A new method for multi-optimization problems based on degree of grey incidence
Cites work
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- A simple recipe for concise mixed 0-1 linearizations
- A survey for the quadratic assignment problem
- Comparison of iterative searches for the quadratic assignment problem
- Exact algorithms for the solution of the grey pattern quadratic assignment problem
- Finding a cluster of points and the grey pattern quadratic assignment problem
- Iterated tabu search for the maximum diversity problem
- Measuring diversity. A review and an empirical analysis
- QAPLIB - a quadratic assignment problem library
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- The equitable dispersion problem
Cited in
(4)
This page was built for publication: Finding optimal solutions to several gray pattern instances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115324)