Solving uniform coverage problem with a modified Remez-algorithm

DOI10.1007/S10589-015-9786-9MaRDI QIDQ2397825zbMATH OpenOpenAlexFDO

Authors Dimitri Nowak, Karl-Heinz Küfer

Publication date 23 May 2017

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-015-9786-9

zbMATH Keywords

Chebyshev approximationAbel solutionRemez-algorithmspunbond processuniform coverage problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Modifications of the First Remez Algorithm
• Publication:4720157
• scientific article; zbMATH DE number 3990026
• On uniform covering, adaptive random search and raspberries
• scientific article; zbMATH DE number 4086244

Cites work

• scientific article; zbMATH DE number 3726635 (Why is no real title available?)
• scientific article; zbMATH DE number 3258269 (Why is no real title available?)
• Modifications of the First Remez Algorithm

This page was built for publication: Solving uniform coverage problem with a modified Remez-algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397825)