2020
DOI: 10.1016/j.dam.2020.04.016
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic programming bi-criteria combinatorial optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
98
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 9 publications
(98 citation statements)
references
References 31 publications
0
98
0
Order By: Relevance
“…I 3 Set of Pareto optimal points for a bi-criteria optimization of parenthesizations relative to Ψ (1) and Ψ (2) . Matrices dimensions are from the interval [1,10], n = 5.4 Set of Pareto optimal points for a bi-criteria optimization of parenthesizations relative to Ψ (1) and Ψ (3) . Matrices dimensions are from the interval [1,10], n = 6.4 Set of Pareto optimal points for a bi-criteria optimization of global sequence alignments relative to Ψ (1) and Ψ (2) for n = 50 and k = 4 .…”
Section: Acknowledgementsmentioning
confidence: 99%
See 4 more Smart Citations
“…I 3 Set of Pareto optimal points for a bi-criteria optimization of parenthesizations relative to Ψ (1) and Ψ (2) . Matrices dimensions are from the interval [1,10], n = 5.4 Set of Pareto optimal points for a bi-criteria optimization of parenthesizations relative to Ψ (1) and Ψ (3) . Matrices dimensions are from the interval [1,10], n = 6.4 Set of Pareto optimal points for a bi-criteria optimization of global sequence alignments relative to Ψ (1) and Ψ (2) for n = 50 and k = 4 .…”
Section: Acknowledgementsmentioning
confidence: 99%
“…. 12.4 Set of Pareto optimal points for a bi-criteria optimization of bitonic tours (n = 300, x max = 1000 and y max = 3000) relative to Ψ (1) and Ψ (2) 12.5 Set of Pareto optimal points for a bi-criteria optimization of bitonic tours (n = 300, x max = 1000 and y max = 3000) relative to Ψ (1) and Ψ (3) 13.1 Sequence of points p 1 , p 2 , p 3 , p…”
Section: Graphmentioning
confidence: 99%
See 3 more Smart Citations