A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization

DOI10.1016/j.ejor.2010.09.034zbMath1205.90303OpenAlexW2123842609WikidataQ57570746 ScholiaQ57570746MaRDI QIDQ621968

Minghe Sun

Publication date: 31 January 2011

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.09.034

zbMATH Keywords

combinatorial optimizationdata structureheuristic proceduresbinary optimizationprimogenitary linked quad tree

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization

Uses Software

• OR-Library
• Scatter Search
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• InterQuad: An interactive quad tree based procedure for solving the discrete alternative multiple criteria problem
• A note on hashing functions and tabu search algorithms
• Quad trees: A data structure for retrieval by composite keys
• Hashing vectors for tabu search
• A primogenitary linked quad tree data structure and its application to discrete multiple criteria optimization
• Solving the uncapacitated facility location problem using tabu search
• MOAQ and ant-Q algorithm for multiple objective optimization problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Tabu Search—Part I
• Tabu Search—Part II
• Quad-Trees and Linear Lists for Identifying Nondominated Criterion Vectors
• Project scheduling with time-varying resource constraints
• Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem