The Seesaw Algorithm: Function Optimization Using Implicit Hitting Sets
Published in DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) • Jan 1, 2021
Authors:,,
Mikoláš Janota
António Morgado
José Fragoso Santos
Abstract
The paper introduces the Seesaw algorithm, which explores the Pareto frontier of two given functions. The algorithm is complete and generalizes the well-known implicit hitting set paradigm. The first given function determines a cost of a hitting set and is optimized by an exact solver. The second, c...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!