A Fast Incremental BSP Tree Archive for Non-dominated Points

DOI10.1007/978-3-319-54157-0_18zbMath1430.90507arXiv1604.01169OpenAlexW2518870586MaRDI QIDQ5215918

Tobias Glasmachers

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

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

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

This page was built for publication: A Fast Incremental BSP Tree Archive for Non-dominated Points