Boosting efficiency for computing the Pareto frontier on tree structured networks

DOI10.1007/978-3-319-93031-2_19OpenAlexW2805569781MaRDI QIDQ1626740

Yexiang Xue, Qinru Shi, Roosevelt García-Villacorta, Jonathan M. Gomes-Selman, Alexander S. Flecker, Carla P. Gomes

Publication date: 21 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-93031-2_19

zbMATH Keywords

multi-objective optimizationdynamic programmingapproximation algorithmsmixed-integer programmingPareto frontier

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Multi-objective and goal programming (90C29)

Related Items (1)

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

This page was built for publication: Boosting efficiency for computing the Pareto frontier on tree structured networks