Boosting Efficiency for Computing the Pareto Frontier on Tree Structured Networks - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Jonathan M. Gomes-Selman, Qinru Shi, Yexiang Xue, Roosevelt García-Villacorta, Alexander S. Flecker, Carla P. Gomes. Boosting Efficiency for Computing the Pareto Frontier on Tree Structured Networks. In Willem Jan van Hoeve, editor, Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26-29, 2018, Proceedings. Volume 10848 of Lecture Notes in Computer Science, pages 263-279, Springer, 2018. [doi]

The following publications are possibly variants of this publication:

Linear time algorithms for computing the most reliable source on an unreliable tree networkGuoliang Xue. networks, 30(1):37-45, 1997. [doi]

Efficiently Approximating High-Dimensional Pareto Frontiers for Tree-Structured Networks Using Expansion and CompressionYiwei Bai, Qinru Shi, Marc Grimson, Alexander Flecker, Carla P. Gomes. cpaior 2023: 1-17 [doi]

runs on WebDSL