Parameterized algorithms for computing Pareto sets
From MaRDI portal
Cites work
- A faster tree-decomposition based algorithm for counting linear extensions
- A label correcting approach for solving bicriterion shortest-path problems
- A linear time algorithm for finding tree-decompositions of small treewidth
- Complexity of Finding Embeddings in a k-Tree
- Discrete dynamic programming and capital allocation
- Efficient problem solving on tree decompositions using binary decision diagrams
- Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS
- Graph minors. II. Algorithmic aspects of tree-width
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- Improved bounds on planar k-sets and k-levels
- Improved smoothed analysis of multiobjective optimization
- Improving the efficiency of dynamic programming on tree decompositions via machine learning
- Jdrasil: a modular library for computing tree decompositions
- Multicriteria Optimization
- On the cardinality of the Pareto set in bicriteria shortest path problems
- Parameterized algorithms
- Parametric and kinetic minimum spanning trees
- Pareto optimal solutions for smoothed analysts
- Shortest paths in networks with vector weights
- Smoothed Analysis of Multiobjective Optimization
- The smoothed number of Pareto-optimal solutions in bicriteria integer optimization
- Tree decompositions of graphs: saving memory in dynamic programming
- Tree decompositions with small cost
This page was built for publication: Parameterized algorithms for computing Pareto sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322521)
