A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization
From MaRDI portal
(Redirected from Publication:621968)
Recommendations
Cites work
- scientific article; zbMATH DE number 3889305 (Why is no real title available?)
- scientific article; zbMATH DE number 3470175 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A note on hashing functions and tabu search algorithms
- A primogenitary linked quad tree data structure and its application to discrete multiple criteria optimization
- Fundamentals of scatter search and path relinking
- Hashing vectors for tabu search
- InterQuad: An interactive quad tree based procedure for solving the discrete alternative multiple criteria problem
- MOAQ and ant-Q algorithm for multiple objective optimization problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Optimization by simulated annealing
- Project scheduling with time-varying resource constraints
- Quad trees: A data structure for retrieval by composite keys
- Quad-Trees and Linear Lists for Identifying Nondominated Criterion Vectors
- Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
- Solving the uncapacitated facility location problem using tabu search
- Tabu Search—Part I
- Tabu Search—Part II
Cited in
(2)
This page was built for publication: A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q621968)