Problem dependent optimization (PDO)

DOI10.1007/S10878-014-9826-XzbMath1336.90108OpenAlexW2059268129MaRDI QIDQ266075

Iliya Bluskov

Publication date: 13 April 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9826-x

zbMATH Keywords

optimizationmetaheuristicdiscreteself-improving

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

New constant weight codes and packing numbers

Cites Work

• Pair covering designs with block size 5
• Balanced incomplete block designs with block size 9. II.
• Balanced incomplete block designs with block size 9 and \(\lambda=2,4,8\)
• Balanced incomplete block designs with block size 8
• New results on GDDs, covering, packing and directable designs with block size 5
• Upper bounds on the general covering numberC_λ(v,k,t,m)
• Pair covering and other designs with block size 6
• Super-simple designs with \(v\leq 32\)
• On the number of mutually disjoint cyclic designs and large sets of designs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Problem dependent optimization (PDO)