Efficiently approximating high-dimensional Pareto frontiers for tree-structured networks using expansion and compression

DOI10.1007/978-3-031-33271-5_1MaRDI QIDQ6057241

Qinru Shi, Carla P. Gomes, Alexander S. Flecker, Yiwei Bai, Marc Grimson

Publication date: 4 October 2023

Published in: Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Search for Journal in Brave)

zbMATH Keywords

multi-objective optimizationapproximation DP

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Boosting efficiency for computing the Pareto frontier on tree structured networks
• Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs
• A survey and annotated bibliography of multiobjective combinatorial optimization

This page was built for publication: Efficiently approximating high-dimensional Pareto frontiers for tree-structured networks using expansion and compression