A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization
From MaRDI portal
Recommendations
- A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization
- Output-sensitive algorithms for enumerating the extreme nondominated points of multiobjective combinatorial optimization problems
- A POLYNOMIAL ALGORITHM FOR ENUMERATING ALL VERTICES OF A BASE POLYHEDRON
- An improved algorithm to solve the multi-criteria minimum spanning tree problem
- On spanning tree problems with multiple objectives
Cites work
- scientific article; zbMATH DE number 915988 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3192675 (Why is no real title available?)
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
- Generating all vertices of a polyhedron is hard
- Geometric algorithms and combinatorial optimization.
- Graph-Theoretic Concepts in Computer Science
- Metaheuristics for multiobjective optimisation
- Multicriteria Optimization
- On matroids with multiple objectives
- Reverse search for enumeration
- Stochastic Algorithms: Foundations and Applications
Cited in
(2)
This page was built for publication: A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631100)