A Fast Incremental BSP Tree Archive for Non-dominated Points
From MaRDI portal
Publication:5215918
DOI10.1007/978-3-319-54157-0_18zbMath1430.90507arXiv1604.01169OpenAlexW2518870586MaRDI QIDQ5215918
Publication date: 13 February 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.01169
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
This page was built for publication: A Fast Incremental BSP Tree Archive for Non-dominated Points