Boosting efficiency for computing the Pareto frontier on tree structured networks

DOI10.1007/978-3-319-93031-2_19MaRDI QIDQ1626740zbMATH OpenOpenAlexFDO

Authors Jonathan M. Gomes-Selman, Qinru Shi, Yexiang Xue, Roosevelt García-Villacorta, 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

approximation algorithmsdynamic programmingmixed-integer programmingmulti-objective optimizationPareto frontier

Mathematics Subject Classification ID

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

Recommendations

• Efficient approximation algorithms for multi-objective constraint optimization
• A parallel multiple reference point approach for multi-objective optimization
• Approximating the Pareto optimal set using a reduced set of objective functions
• scientific article; zbMATH DE number 1975104
• Multiobjective optimization via parametric optimization: models, algorithms, and applications

Cited in

(5)

• Optimizing \(K^2\) trees: a case for validating the maturity of network of practices
• Network Models for Multiobjective Discrete Optimization
• Efficiently approximating high-dimensional Pareto frontiers for tree-structured networks using expansion and compression
• Efficient dominance filtering for unions and Minkowski sums of non-dominated sets
• Generator sets for the Minkowski sum problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1626740)