Problem dependent optimization (PDO)
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2222042
- Metaheuristics for dynamic combinatorial optimization problems
- A statistical learning based approach for parameter fine-tuning of metaheuristics
- Metaheuristic vs. deterministic global optimization algorithms: the univariate case
- The future of experimental research
Cites work
- scientific article; zbMATH DE number 2108133 (Why is no real title available?)
- scientific article; zbMATH DE number 5233136 (Why is no real title available?)
- Balanced incomplete block designs with block size 8
- Balanced incomplete block designs with block size 9 and =2,4,8
- Balanced incomplete block designs with block size 9. II.
- New results on GDDs, covering, packing and directable designs with block size 5
- On the number of mutually disjoint cyclic designs and large sets of designs
- Pair covering and other designs with block size 6
- Pair covering designs with block size 5
- Pair covering designs with block size 5 with higher index -- the case of \(v\) even
- Super-simple designs with \(v\leq 32\)
- Upper bounds on the general covering numberCλ(v,k,t,m)
Cited in
(2)
This page was built for publication: Problem dependent optimization (PDO)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266075)