Dynamic programming bi-criteria combinatorial optimization (Q777429): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2020.04.016 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 97 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2020.04.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3022211579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reference points and approximation algorithms in multicriteria discrete optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized dynamic programming for multicriteria optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-criteria optimization of decision trees with applications to data analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating Pareto optimization into dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of Matrix Chain Products. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of Matrix Chain Products. Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Innovations in intelligent machines. 4. Recent advances in knowledge engineering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Triangulations of Polygonal Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking paragraphs into lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding the Maxima of a Set of Vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal binary search trees with costs depending on the access paths. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Boolean Matrices / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2020.04.016 / rank
 
Normal rank

Latest revision as of 03:24, 10 December 2024

scientific article
Language Label Description Also known as
English
Dynamic programming bi-criteria combinatorial optimization
scientific article

    Statements

    Dynamic programming bi-criteria combinatorial optimization (English)
    0 references
    0 references
    0 references
    7 July 2020
    0 references
    dynamic programming
    0 references
    circuit model
    0 references
    bi-criteria optimization
    0 references

    Identifiers