A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization (Q5387795): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matroids with multiple objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all vertices of a polyhedron is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Algorithms: Foundations and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4817401 / rank
 
Normal rank

Latest revision as of 10:55, 28 June 2024

scientific article; zbMATH DE number 5279484
Language Label Description Also known as
English
A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization
scientific article; zbMATH DE number 5279484

    Statements

    A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization (English)
    0 references
    0 references
    0 references
    27 May 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references